On the query complexity of clique size and maximum satisfiability
暂无分享,去创建一个
[1] Richard Chang. On the Query Complexity of Clique Size and Maximum Satisfiability , 1996, J. Comput. Syst. Sci..
[2] Richard Chang,et al. A Machine Model for NP-Approximation Problems and the Revenge of the Boolean Hierarchy , 1994, Bull. EATCS.
[3] Zhi-Zhong Chen,et al. On the Complexity of Computing Optimal Solutions , 1990, Int. J. Found. Comput. Sci..
[4] David Zuckerman,et al. NP-complete problems have a version that's hard to approximate , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.
[5] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[7] Desh Ranjan,et al. Quantifiers and approximation , 1990, STOC '90.
[8] Juris Hartmanis,et al. The Boolean Hierarchy I: Structural Properties , 1988, SIAM J. Comput..
[9] Arfst Nickelsen,et al. Counting, Selecting, adn Sorting by Query-Bounded Machines , 1993, STACS.
[10] R. Beigel,et al. Bounded Queries to SAT and the Boolean Hierarchy , 1991, Theor. Comput. Sci..
[11] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[12] Mihalis Yannakakis,et al. On the approximation of maximum satisfiability , 1992, SODA '92.
[13] R. Beigel. NP-hard Sets are P-Superterse Unless R = NP , 1988 .
[14] Carsten Lund,et al. On the hardness of approximating minimization problems , 1993, STOC.
[15] Luca Trevisan,et al. Structure in Approximation Classes , 1999, Electron. Colloquium Comput. Complex..
[16] William I. Gasarch,et al. On bounded queries and approximation , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[17] Amihood Amir,et al. Polynomial Terse Sets , 1988, Inf. Comput..
[18] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[19] Carsten Lund,et al. Efficient probabilistically checkable proofs and applications to approximations , 1993, STOC.
[20] Mark W. Krentel. The Complexity of Optimization Problems , 1988, J. Comput. Syst. Sci..
[21] Amihood Amir,et al. Some connections between bounded query classes and nonuniform complexity , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.
[22] Mark W. Krentel. The complexity of optimization problems , 1986, STOC '86.