Uniform constant-depth threshold circuits for division and iterated multiplication
Journal of Computer and System Sciences - Complexity 2001
Incremental Validation of XML Documents
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Word Problems for 2-Homogeneous Monoids and Symmetric Logspace
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
On the Parallel Complexity of Tree Automata
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Monotone Proofs of the Pigeon Hole Principle
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Typing and querying XML documents: some complexity bounds
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The hardest linear conjunctive language
Information Processing Letters
A recognition and parsing algorithm for arbitrary conjunctive grammars
Theoretical Computer Science
SIGACT news complexity theory column 42
ACM SIGACT News
Efficient Incremental Validation of XML Documents
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Incremental validation of XML documents
ACM Transactions on Database Systems (TODS)
The complexity of XPath query evaluation and XML typing
Journal of the ACM (JACM)
Functions computable in polynomial space
Information and Computation
Parallelizing time with polynomial circuits
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
The intractability of computing the Hamming distance
Theoretical Computer Science
Languages to diagonalize against advice classes
Computational Complexity
Generic semantics of feature diagrams
Computer Networks: The International Journal of Computer and Telecommunications Networking
Logical definability and query languages over ranked and unranked trees
ACM Transactions on Computational Logic (TOCL)
Three "quantum" algorithms to solve 3-SAT
Theoretical Computer Science
Reversible P Systems to Simulate Fredkin Circuits
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
ACM SIGACT News
Characterizing Valiant's algebraic complexity classes
Journal of Complexity
Finding a vector orthogonal to roughly half a collection of vectors
Journal of Complexity
Randomness-Efficient Sampling within NC1
Computational Complexity
Uniform Circuits, & Boolean Proof Nets
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Extensional Uniformity for Boolean Circuits
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
The Complexity of Satisfiability for Fragments of CTL and CTL*;
Electronic Notes in Theoretical Computer Science (ENTCS)
Solving SUBSET SUM by Spiking Neural P Systems with Pre-computed Resources
Fundamenta Informaticae
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?
Complexity of Constraints
On the complexity of constructing Golomb Rulers
Discrete Applied Mathematics
The complexity of satisfiability problems: Refining Schaefer's theorem
Journal of Computer and System Sciences
Boolean circuit programming: A new paradigm to design parallel algorithms
Journal of Discrete Algorithms
Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Parallelizing quantum circuits
Theoretical Computer Science
The Complexity of Reasoning for Fragments of Default Logic
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
The complexity of propositional implication
Information Processing Letters
The Complexity of Circumscriptive Inference in Post's Lattice
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Amplifying lower bounds by means of self-reducibility
Journal of the ACM (JACM)
Functions computable in polynomial space
Information and Computation
The DL-lite family and relations
Journal of Artificial Intelligence Research
Complexity theory made easy: the formal language approach to the definition of complexity classes
DLT'03 Proceedings of the 7th international conference on Developments in language theory
On defining integers in the counting hierarchy and proving arithmetic circuit lower bounds
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Arithmetizing classes around NC1and L
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Secure multiparty computations using a dial lock
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Small-space analogues of Valiant's classes
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Complexity and algorithms for well-structured k-SAT instances
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Generalized modal satisfiability
Journal of Computer and System Sciences
On the complexity of membership and counting in height-deterministic pushdown automata
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
The parameterized complexity of editing graphs for bounded degeneracy
Theoretical Computer Science
transalpyne: a language for automatic transposition
ACM Communications in Computer Algebra
Affine image matching is uniform TC0-complete
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Database theory: query languages
Algorithms and theory of computation handbook
Counting classes and the fine structure between NC1and L
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Limiting negations in bounded treewidth and upward planar circuits
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Non-deterministic Boolean proof nets
FOPARA'09 Proceedings of the First international conference on Foundational and practical aspects of resource analysis
Uniform derandomization from pathetic lower bounds
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
Journal of Computer and System Sciences
On the complexity of membership and counting in height-deterministic pushdown automata
Journal of Automata, Languages and Combinatorics
Extensional Uniformity for Boolean Circuits
SIAM Journal on Computing
A linear algorithm for MLL proof net correctness and sequentialization
Theoretical Computer Science
Leaf languages and string compression
Information and Computation
On the Effect of Quantum Interaction Distance on Quantum Addition Circuits
ACM Journal on Emerging Technologies in Computing Systems (JETC)
On the Power of Isolation in Planar Graphs
ACM Transactions on Computation Theory (TOCT)
Nexp does not have non-uniform quasipolynomial-size ACC circuits of o(log log n) depth
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Counting, fanout and the complexity of quantum ACC
Quantum Information & Computation
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
Verifying proofs in constant depth
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
On the complexity of szilard languages of regulated grammars
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Marginal hitting sets imply super-polynomial lower bounds for permanent
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Generalized modal satisfiability
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Evaluating monotone circuits on cylinders, planes and tori
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Constant-Depth circuits for arithmetic in finite fields of characteristic two
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Counting classes and the fine structure between NC1 and L
Theoretical Computer Science
Proof complexity of non-classical logics
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Streaming algorithms for some problems in log-space
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Conservative computations in energy–based p systems
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Universal families of reversible p systems
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Decidable membership problems for finite recurrent systems over sets of naturals
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Space complexity of perfect matching in bounded genus bipartite graphs
Journal of Computer and System Sciences
Randomness-efficient sampling within NC1
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Discrete Applied Mathematics
The dynamic complexity of formal languages
ACM Transactions on Computational Logic (TOCL)
Computing bits of algebraic numbers
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Parameterized complexity of weighted satisfiability problems
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Proof complexity of non-classical logics
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
Non-definability of Languages by Generalized First-order Formulas over (N,+)
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Solving SUBSET SUM by Spiking Neural P Systems with Pre-computed Resources
Fundamenta Informaticae
The lower reaches of circuit uniformity
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Reversible P Systems to Simulate Fredkin Circuits
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Information Processing Letters
The complexity of membership problems for circuits over sets of positive numbers
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
On the complexity of matrix rank and rigidity
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Permanent does not have succinct polynomial size arithmetic circuits of constant depth
Information and Computation
Verifying proofs in constant depth
ACM Transactions on Computation Theory (TOCT)
Streaming algorithms for language recognition problems
Theoretical Computer Science
Counting paths in planar width 2 branching programs
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits
Computational Complexity
The Complexity of Szilard Languages of Matrix Grammars Revisited
Fundamenta Informaticae
| Hi-index | 0.05 |
From the Publisher:This advanced handbook presents a broad and up-to-date view of the computational complexity theory of Boolean circuits. It combines the algorithmic and the automata-theoretic approaches, and includes an extensive discussion of the literature to facilitate future research.