NP is as easy as detecting unique solutions
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
The Complexity of Near-Optimal Graph Coloring
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
On the complexity of compact coalitional games
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
An analysis of slow convergence in interval propagation
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Economies with non-convex production and complexity equilibria
Proceedings of the 12th ACM conference on Electronic commerce
On the complexity of core, kernel, and bargaining set
Artificial Intelligence
The complexity of semilinear problems in succinct representation
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |