Complexity classes defined by counting quantifiers
Journal of the ACM (JACM)
When do extra majority gates help?
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Gap-definable counting classes
Journal of Computer and System Sciences
NP trees and Carnap's modal logic
Journal of the ACM (JACM)
SIGACT news complexity theory column 35
ACM SIGACT News
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in 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
Restrictive Acceptance Suffices for Equivalence Problems
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Alternating and empty alternating auxiliary stack automata
Theoretical Computer Science
Acceptance by Transformation Monoids (with an Application to Local Self Reductions)
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Some connections between bounded query classes and non-uniform complexity
Information and Computation
The complexity of tensor calculus
Computational Complexity
Lower bounds and the hardness of counting properties
Theoretical Computer Science
Quantum and classical complexity classes: separations, collapses, and closure properties
Information and Computation
A common algebraic description for probabilistic and quantum computations
Theoretical Computer Science - Mathematical foundations of computer science 2004
The complexity of chromatic strength and chromatic edge strength
Computational Complexity
The complexity of Kemeny elections
Theoretical Computer Science
The Complexity of Tensor Circuit Evaluation
Computational Complexity
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers
Computational Complexity
On Toda's Theorem in Structural Communication Complexity
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Quantum and classical complexity classes: Separations, collapses, and closure properties
Information and Computation
The computational complexity of equivalence and isomorphism problems
The computational complexity of equivalence and isomorphism problems
Acceptor-definable counting classes
PCI'01 Proceedings of the 8th Panhellenic conference on Informatics
The complexity of symmetric Boolean parity Holant problems
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Completeness for parity problems
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Guarantees for the success frequency of an algorithm for finding dodgson-election winners
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
The complexity of semilinear problems in succinct representation
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
The complexity of computing minimal unidirectional covering sets
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Survey: A glimpse at Christos H. Papadimitriou
Computer Science Review
Survey: The consequences of eliminating NP solutions
Computer Science Review
A very difficult scheduling problem with communication delays
Operations Research Letters
Sharing rewards in cooperative connectivity games
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |