The relative complexity of NP search problems

Authors:
Paul Beame;Stephen Cook;Jeff Edmonds;Russell Impagliazzo;Toniann Pitassi
Affiliations:
Computer Science and Engineering, University of Washington;Computer Science Dept., University of Toronto;I.C.S.I. Berkeley, CA;Computer Science Dept., UCSD;Mathematics and Computer Science, University of Pittsburgh
Venue:
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Year:
1995

How easy is local search?

Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
On the complexity of local search

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
On the complexity of the parity argument and other inefficient proofs of existence

Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990

Using the Groebner basis algorithm to find proofs of unsatisfiability

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Inverting onto functions

Information and Computation
Homogenization and the polynomial calculus

Computational Complexity
Search heuristics for constraint-aided embodiment design

Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Entailment multipliers: an algebraic characterization of validity for classical and modal logics

WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation

Hi-index	0.00