Complete problems for deterministic polynomial time
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
An observation on time-storage trade off
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
The Boolean formula value problem is in ALOGTIME
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Dynamic parallel complexity of computational circuits
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Using smoothness to achieve parallelism
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On the relationship of congruence closureand unification
Journal of Symbolic Computation
A Note on Nondeterminism in Small, Fast Parallel Computers
IEEE Transactions on Computers
Integral equations, systems of quadratic equations, and exponential time completeness
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
An efficient parallel algorithm for the general planar monotone circuit value problem4
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
An overview of computational complexity
Communications of the ACM
Circuits And Expressions With Non-Associative Gates
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Complexity of finitely presented algebras
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Deterministic CFL's are accepted simultaneously in polynomial time and log squared space
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
SIGACT news complexity theory column 42
ACM SIGACT News
Linear lambda calculus and PTIME-completeness
Journal of Functional Programming
Tantrix TM rotation puzzles are intractable
Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
The intractability of computing the Hamming distance
Theoretical Computer Science
The enumerability of P collapses P to NC
Theoretical Computer Science - Mathematical foundations of computer science 2004
The Complexity of Tensor Circuit Evaluation
Computational Complexity
An overview of computational complexity
ACM Turing award lectures
Relating complexity and precision in control flow analysis
ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
Deciding kCFA is complete for EXPTIME
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Flow Analysis, Linearity, and PTIME
SAS '08 Proceedings of the 15th international symposium on Static Analysis
On the Complexity of Equilibria Problems in Angel-Daemon Games
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
A Characterisation of NL Using Membrane Systems without Charges and Dissolution
UC '08 Proceedings of the 7th international conference on Unconventional Computing
Alternation as a programming paradigm
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
How to Order Vertices for Distributed LTL Model-Checking Based on Accepting Predecessors
Electronic Notes in Theoretical Computer Science (ENTCS)
A note on the space complexity of some decision problems for finite automata
Information Processing Letters
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
A simple P-complete problem and its representations by language equations
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Active membrane systems without charges and using only symmetric elementary division characterise P
WMC'07 Proceedings of the 8th international conference on Membrane computing
Algorithms and theory of computation handbook
Parallel computation: models and complexity issues
Algorithms and theory of computation handbook
Theoretical Computer Science
A simple P-complete problem and its language-theoretic representations
Theoretical Computer Science
One-input-face MPCVP is hard for l, but in LogDCFL
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Some observations on holographic algorithms
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
On the power of nodes of degree four in the local max-cut problem
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
A generalization of spira's theorem and circuits with small segregators or separators
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Verification of ad hoc networks with node and communication failures
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
On the PLS-complexity of maximum constraint assignment
Theoretical Computer Science
Lewis Dichotomies in Many-Valued Logics
Studia Logica
Computational Aspects of Uncertainty Profiles and Angel-Daemon Games
Theory of Computing Systems
| Hi-index | 0.02 |