Complexity and structure
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Random generation of combinatorial structures from a uniform
Theoretical Computer Science
NP is as easy as detecting unique solutions
Theoretical Computer Science
Does co-NP have short interactive proofs?
Information Processing Letters
A lower bound for read-once-only branching programs
Journal of Computer and System Sciences
The complexity of Boolean functions
The complexity of Boolean functions
On the complexity of branching programs and decision trees for clique functions
Journal of the ACM (JACM)
Are there interactive protocols for CO-NP languages?
Information Processing Letters
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
Graph isomorphism is in the low hierarchy
Journal of Computer and System Sciences
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Probalisitic complexity classes and lowness
Journal of Computer and System Sciences
Modified branching programs and their computational power
Modified branching programs and their computational power
Lower bounds for depth-restricted branching programs
Information and Computation
Boolean functions, invariance groups, and parallel complexity
SIAM Journal on Computing
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Journal of the ACM (JACM)
Separating the eraser Turing machine classes Le, NLe, co-NLe and Pe
Theoretical Computer Science
PP is as hard as the polynomial-time hierarchy
SIAM Journal on Computing
A logspace algorithm for tree canonization (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The history and status of the P versus NP question
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Reduction of OBDDs in linear time
Information Processing Letters
The graph isomorphism problem: its structural complexity
The graph isomorphism problem: its structural complexity
Efficient data structures for Boolean functions
Discrete Mathematics - Special issue: trends in discrete mathematics
Graph driven BDDs—a new data structure for Boolean functions
Theoretical Computer Science
On unique satisfiability and the threshold behavior of randomized reductions
Journal of Computer and System Sciences
On the size of binary decision diagrams representing Boolean functions
Theoretical Computer Science
On lower bounds for read-k-times branching programs
Computational Complexity
Formal Methods in System Design
Oracles and queries that are sufficient for exact learning
Journal of Computer and System Sciences
Improving the Variable Ordering of OBDDs Is NP-Complete
IEEE Transactions on Computers
Restricted branching programs and hardware verification
Restricted branching programs and hardware verification
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Reducing randomness via irrational numbers
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Hierarchy theorems for kOBDDs and kIBDDs
Theoretical Computer Science
Parity OBDDs cannot be handled efficiently enough
Information Processing Letters
On Asymptotic Estimates in Switching and Automata Theory
Journal of the ACM (JACM)
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs
Journal of the ACM (JACM)
Introduction to the Theory of Computation: Preliminary Edition
Introduction to the Theory of Computation: Preliminary Edition
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Efficient Boolean Manipulation with OBDD's Can be Extended to FBDD's
IEEE Transactions on Computers
An Exponential Lower Bound for One-Time-Only Branching Programs
Proceedings of the Mathematical Foundations of Computer Science 1984
On the Complexity of Constructing Optimal Ordered Binary Decision Diagrams
MFCS '94 Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994
Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
The Complexity of Equivalence and Containment for Free Single Variable Program Schemes
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
On the Power of Randomized Branching Programs
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching Programs
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
The Complexity of Generating and Checking Proffs of Membership
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Lower Bounds for Randomized Read-k-Times Branching Programs (Extended Abstract)
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Equivalence Test and Ordering Transformation for Parity-OBDDs of Different Variable Ordering
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Probabilistic algorithms for sparse polynomials
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
Two remarks on the power of counting
Proceedings of the 6th GI-Conference on Theoretical Computer Science
The Effect of Null-Chains on the Complexity of Contact Schemes
FCT '89 Proceedings of the International Conference on Fundamentals of Computation Theory
Alogtime Algorithms for Tree Isomorphism, Comparison, and Canonization
KGC '97 Proceedings of the 5th Kurt Gödel Colloquium on Computational Logic and Proof Theory
The Satisfiability Problem for Probabilistic Ordered Branching Programs
COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
The Minimum Equivalent DNF Problem and Shortest Implicants
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
A complexity theoretic approach to randomness
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
The Boolean isomorphism problem
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
The equivalence problem for regular expressions with squaring requires exponential space
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Automation and Remote Control
Equilibria problems on games: Complexity versus succinctness
Journal of Computer and System Sciences
Pure nash equilibria in games with a large number of actions
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
On the computational complexity of the forcing chromatic number
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
On the isomorphism problem for decision trees and decision lists
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |