%0 Conference Paper %1 conf/approx/CheboluGM10 %A Chebolu, Prasad %A Goldberg, Leslie Ann %A Martin, Russell A. %B APPROX-RANDOM %D 2010 %E Serna, Maria J. %E Shaltiel, Ronen %E Jansen, Klaus %E Rolim, José D. P. %I Springer %K dblp %P 81-94 %T The Complexity of Approximately Counting Stable Matchings. %U http://dblp.uni-trier.de/db/conf/approx/approx2010.html#CheboluGM10 %V 6302 %@ 978-3-642-15368-6

@inproceedings{conf/approx/CheboluGM10, added-at = {2017-05-23T00:00:00.000+0200}, author = {Chebolu, Prasad and Goldberg, Leslie Ann and Martin, Russell A.}, biburl = {https://www.bibsonomy.org/bibtex/2789cad10a1280fc00a26daa53ba8ef14/dblp}, booktitle = {APPROX-RANDOM}, crossref = {conf/approx/2010}, editor = {Serna, Maria J. and Shaltiel, Ronen and Jansen, Klaus and Rolim, José D. P.}, ee = {https://doi.org/10.1007/978-3-642-15369-3_7}, interhash = {a2b68ed7ed662846809c7e85789bbf2d}, intrahash = {789cad10a1280fc00a26daa53ba8ef14}, isbn = {978-3-642-15368-6}, keywords = {dblp}, pages = {81-94}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2024-04-10T00:35:02.000+0200}, title = {The Complexity of Approximately Counting Stable Matchings.}, url = {http://dblp.uni-trier.de/db/conf/approx/approx2010.html#CheboluGM10}, volume = 6302, year = 2010 }