On counting and approximation
- 10 June 2005
- book chapter
- Published by Springer Nature
- Vol. 26 (4) , 40-51
- https://doi.org/10.1007/bfb0026095
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Graph isomorphism is in the low hierarchyPublished by Springer Nature ,2006
- Does co-NP have short interactive proofs?Information Processing Letters, 1987
- The complexity of optimization problemsPublished by Association for Computing Machinery (ACM) ,1986
- Random generation of combinatorial structures from a uniform distributionTheoretical Computer Science, 1986
- Private coins versus public coins in interactive proof systemsPublished by Association for Computing Machinery (ACM) ,1986
- On Approximation Algorithms for # PSIAM Journal on Computing, 1985
- Trading group theory for randomnessPublished by Association for Computing Machinery (ACM) ,1985
- A complexity theoretic approach to randomnessPublished by Association for Computing Machinery (ACM) ,1983
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- Relative complexity of checking and evaluatingInformation Processing Letters, 1976