Are there interactive protocols for CO-NP languages?
Information Processing Letters
Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Cyclic games and an algorithm to find minimax cycle means in directed graphs
USSR Computational Mathematics and Mathematical Physics
On the complexity of local search
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Simple local search problems that are hard to solve
SIAM Journal on Computing
On total functions, existence theorems and computational complexity
Theoretical Computer Science
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The complexity of the Lin-Kernighan heuristic for the traveling salesman problem
SIAM Journal on Computing
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
The complexity of stochastic games
Information and Computation
The generic oracle hypothesis is false
Information Processing Letters
Cyclical games with prohibitions
Mathematical Programming: Series A and B
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
The complexity of mean payoff games on graphs
Theoretical Computer Science
Theory of hybrid systems and discrete event systems
Theory of hybrid systems and discrete event systems
Deciding the winner in parity games is in UP ∩ co-UP
Information Processing Letters
The relative complexity of NP search problems
Journal of Computer and System Sciences
Analysis of a local search heuristic for facility location problems
Journal of Algorithms
A sperner lemma complete for PPA
Information Processing Letters
Local search heuristic for k-median and facility location problems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On Relativization and the Existence of Complete Sets
Proceedings of the 9th Colloquium on Automata, Languages and Programming
The Analysis of Local Search Problems and Their Heuristics
STACS '90 Proceedings of the 7th Annual Symposium on Theoretical Aspects of Computer Science
Playing large games using simple strategies
Proceedings of the 4th ACM conference on Electronic commerce
Information and Computation
Pure Nash equilibria: hard and easy games
Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
One-way permutations and self-witnessing languages
Journal of Computer and System Sciences
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Relativized NP Search Problems and Propositional Proof Systems
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
A deterministic subexponential algorithm for solving parity games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Reducibility among equilibrium problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The complexity of computing a Nash equilibrium
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Settling the Complexity of Two-Player Nash Equilibrium
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Computing Nash Equilibria: Approximation and Smoothed Complexity
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP: extended abstract
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Locally 2-dimensional sperner problems complete for the polynomial parity argument classes
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
On the complexity of 2d discrete fixed point problem
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Pure nash equilibria in games with a large number of actions
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
A CSP-Based Approach for Solving Parity Game
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Settling the complexity of computing two-player Nash equilibria
Journal of the ACM (JACM)
Integer Programming: Optimization and Evaluation Are Equivalent
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Survey: Equilibria, fixed points, and complexity classes
Computer Science Review
On the violation of circuits in decomposable negation normal form
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
| Hi-index | 0.00 |
This is the 26th edition of a column that covers new developments in the theory of NP-completeness. The presentation is modeled on that which M. R. Garey and I used in our book “Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., New York, 1979, hereinafter referred to as “[G&J].” Previous columns, the first 23 of which appeared in J. Algorithms, will be referred to by a combination of their sequence number and year of appearance, e.g., “Column 1 [1981].” Full bibliographic details on the previous columns, as well as downloadable unofficial versions of them, can be found at http://www.research.att.com/∼dsj/columns/. This column discusses the question of whether finding an object can be computationally difficult even when we know that the object exists.