| Document Date: 2005-07-06 08:19:14
Open Document File Size: 406,82 KBShare Result on Facebook
City Springer Verlag / London / / Company SIAM Journal / Monte / / Country United Kingdom / / Currency pence / / / Facility Square Grid Graph / / IndustryTerm linear time approximation algorithm / similar algorithms / approximation algorithm / efficient approximation algorithms / polynomial time approximation algorithm / randomized algorithm / on-line encyclopedia / approximation scheme algorithm / simpler algorithm / / Organization Pennsylvania State University University / National Science Foundation / / Person Paul W. Purdom / David R. Karger / Steve Chien / Stein Karger / Shiva Prasad Kasiviswanathan / Donald E. Knuth / Victor De la Pena / Evarist Gin / / / ProgrammingLanguage E / / ProvinceOrState New Jersey / Pennsylvania / New York / / PublishedMedium SIAM Journal on Computing / Journal of the ACM / Mathematics of Computation / Theoretical Computer Science / / Technology one approximation algorithm / efficient approximation algorithms / randomized algorithm / determinant-based algorithm / much simpler algorithm / linear time approximation algorithm / polynomial time approximation algorithm / approximation scheme algorithm / / URL http /
SocialTag |
Approximately Counting Perfect Matchings in General Graphs Martin F¨ urer ∗ Shiva Prasad Kasiviswanathan Computer Science and Engineering Pennsylvania State University University Park, PA 16802. {furer, kasivisw}@cse.