STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Depth reduction for noncommutative arithmetic circuits
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Gap-definable counting classes
Journal of Computer and System Sciences
PSPACE is provable by two provers in one round
Journal of Computer and System Sciences
ACM SIGACT News
Power balance and apportionment algorithms for the United States Congress
Journal of Experimental Algorithmics (JEA)
Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Hardness and hierarchy theorems for probabilistic quasi-polynomial time
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Complexity of finite-horizon Markov decision process problems
Journal of the ACM (JACM)
Computational Politics: Electoral Systems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Derandomizing Arthur-Merlin Games under Uniform Assumptions
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Competing Provers Yield Improved Karp-Lipton Collapse Results
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
On Higher Arthur-Merlin Classes
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
On the relative complexity of approximate counting problems
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
A Generalized Quantifier Concept in Computational Complexity Theory
ESSLLI '97 Revised Lectures from the 9th European Summer School on Logic, Language, and Information: Generalized Quantifiers and Computation
Derandomizing polynomial identity tests means proving circuit lower bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Six Hypotheses in Search of a Theorem
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Acceptance by Transformation Monoids (with an Application to Local Self Reductions)
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes
Theoretical Computer Science
Some connections between bounded query classes and non-uniform complexity
Information and Computation
The complexity of tensor calculus
Computational Complexity
Average-case intractability vs. worst-case intractability
Information and Computation
Counting complexity classes for numeric computations II: algebraic and semialgebraic sets
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Theoretical Computer Science
The correlation between parity and quadratic polynomials mod 3
Journal of Computer and System Sciences - Special issue on computational complexity 2002
Beyond NP: the work and legacy of Larry Stockmeyer
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
Competing provers yield improved Karp-Lipton collapse results
Information and Computation
Quantum and classical complexity classes: separations, collapses, and closure properties
Information and Computation
Complexity results on DPLL and resolution
ACM Transactions on Computational Logic (TOCL)
Languages to diagonalize against advice classes
Computational Complexity
LWPP and WPP are not uniformly gap-definable
Journal of Computer and System Sciences
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy
Theoretical Computer Science
A survey of lower bounds for satisfiability and related problems
Foundations and Trends® in Theoretical Computer Science
Pseudorandomness and Average-Case Complexity Via Uniform Reductions
Computational Complexity
On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane
Electronic Notes in Theoretical Computer Science (ENTCS)
Algebrization: a new barrier in complexity theory
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Hardness-randomness tradeoffs for bounded depth arithmetic circuits
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Complexity of combinatorial market makers
Proceedings of the 9th ACM conference on Electronic commerce
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
The Complexity of Power-Index Comparison
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Universal relations and #P-completeness
Theoretical Computer Science
The parameterized complexity of probability amplification
Information Processing Letters
A logical characterization of the counting hierarchy
ACM Transactions on Computational Logic (TOCL)
Lower Bounds for Swapping Arthur and Merlin
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Efficient learning algorithms yield circuit lower bounds
Journal of Computer and System Sciences
Note: The complexity of power-index comparison
Theoretical Computer Science
Algebrization: A New Barrier in Complexity Theory
ACM Transactions on Computation Theory (TOCT)
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?
Complexity of Constraints
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
Recursion Theoretic Operators for Function Complexity Classes
IEICE - Transactions on Information and Systems
Proceedings of the forty-first annual ACM symposium on Theory of computing
An axiomatic approach to algebrization
Proceedings of the forty-first annual ACM symposium on Theory of computing
On the Connection between Interval Size Functions and Path Counting
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Structural properties of oracle classes
Information Processing Letters
Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Pseudorandom Generators and Typically-Correct Derandomization
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Complexity results and approximation strategies for MAP explanations
Journal of Artificial Intelligence Research
The computational complexity of probabilistic planning
Journal of Artificial Intelligence Research
Competing provers yield improved Karp-Lipton collapse results
Information and Computation
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
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
A tighter bound for counting max-weight solutions to 2SAT instances
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Other complexity classes and measures
Algorithms and theory of computation handbook
Randomisation and derandomisation in descriptive complexity theory
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
On bounding problems of quantitative information flow
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
Extensions of MSO and the monadic counting hierarchy
Information and Computation
Arithmetic Circuits: A survey of recent results and open questions
Foundations and Trends® in Theoretical Computer Science
Leaf languages and string compression
Information and Computation
The computational complexity of linear optics
Proceedings of the forty-third annual ACM symposium on Theory of computing
A note on quantum algorithms and the minimal degree of ε-error polynomials for symmetric functions
Quantum Information & Computation
Exact learning algorithms, betting games, and circuit lower bounds
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Permanent does not have succinct polynomial size arithmetic circuits of constant depth
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Most probable explanations in Bayesian networks: Complexity and tractability
International Journal of Approximate Reasoning
MAP complexity results and approximation methods
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
The complexity of plan existence and evaluation in robabilistic domains
UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
Marginal hitting sets imply super-polynomial lower bounds for permanent
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
On graph isomorphism for restricted graph classes
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Efficient learning algorithms yield circuit lower bounds
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Recursion theoretic operators for function complexity classes
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
A new approach to model counting
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Universal relations and #p-completeness
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
The complexity of counting functions with easy decision version
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Randomized approximations of parameterized counting problems
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
FQAS'11 Proceedings of the 9th international conference on Flexible Query Answering Systems
Algorithms for modular counting of roots of multivariate polynomials
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
P systems simulating oracle computations
CMC'11 Proceedings of the 12th international conference on Membrane Computing
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Approximating the Permanent via Nonabelian Determinants
SIAM Journal on Computing
Same-decision probability: A confidence measure for threshold-based decisions
International Journal of Approximate Reasoning
Permanent does not have succinct polynomial size arithmetic circuits of constant depth
Information and Computation
Some Remarks Concerning the Algorithmic Analysis of Gene Regulatory Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
A dichotomy in the complexity of counting database repairs
Journal of Computer and System Sciences
Exact Learning Algorithms, Betting Games, and Circuit Lower Bounds
ACM Transactions on Computation Theory (TOCT)
A generalization of SAT and #SAT for robust policy evaluation
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Nonuniform ACC Circuit Lower Bounds
Journal of the ACM (JACM)
On bounding problems of quantitative information flow
Journal of Computer Security - ESORICS 2010
| Hi-index | 0.01 |