NP is as easy as detecting unique solutions
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Simple characterizations of P(#P) and complete problems
Journal of Computer and System Sciences
Approximately counting Hamilton cycles in dense graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
On the relative complexity of approximate counting problems
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Complexity of DNA sequencing by hybridization
Theoretical Computer Science
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
A characterization of the class of functions computable in polynomial time on Random Access Machines
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Nash equilibria in discrete routing games with convex latency functions
Journal of Computer and System Sciences
Private approximation of clustering and vertex cover
TCC'07 Proceedings of the 4th conference on Theory of cryptography
The complexity of approximating bounded-degree Boolean #CSP
Information and Computation
| Hi-index | 0.00 |