NP might not be as easy as detecting unique solutions
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On the complexity of data disjunctions
Theoretical Computer Science - Complexity and logic
Computational Politics: Electoral Systems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Equivalence and Isomorphism for Boolean Constraint Satisfaction
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Six Hypotheses in Search of a Theorem
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Complexity results for explanations in the structural-model approach
Artificial Intelligence
Circuit principles and weak pigeonhole variants
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
The complexity of equivalence and isomorphism of systems of equations over finite groups
Theoretical Computer Science - Mathematical foundations of computer science 2004
Circuit principles and weak pigeonhole variants
Theoretical Computer Science
The directed planar reachability problem
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
On the complexity of entailment in existential conjunctive first-order logic with atomic negation
Information and Computation
Data exchange beyond complete data
Journal of the ACM (JACM)
| Hi-index | 0.01 |