Symmetric logspace is closed under complement
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On BPP versus NP (semi-circle up) coNP for ordered read-once branching programs
Theoretical Computer Science
Lower bounds for linearly transformed OBDDs and FBDDs
Journal of Computer and System Sciences
A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Lower Bounds for Linear Transformed OBDDs and FBDDs (Extende Abstract)
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Some Notes on the Information Flow in Read-Once Branching Programs
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
Randomized Complexity of Linear Arrangements and Polyhedra
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
On Multipartition Communication Complexity
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Almost k-wise independence and hard Boolean functions
Theoretical Computer Science - Latin American theoretical informatics
On uncertainty versus size in branching programs
Theoretical Computer Science
Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines
Journal of Computer and System Sciences
A lower bound for integer multiplication on randomized ordered read-once branching programs
Information and Computation
Comparing the sizes of nondeterministic branching read-k-times programs
Discrete Applied Mathematics
On multi-partition communication complexity
Information and Computation
A hierarchy result for read-once branching programs with restricted parity nondeterminism
Theoretical Computer Science - Mathematical foundations of computer science 2000
Theoretical Computer Science
A nondeterministic space-time tradeoff for linear codes
Information Processing Letters
Amplifying lower bounds by means of self-reducibility
Journal of the ACM (JACM)
On multi-partition communication complexity
Information and Computation
Pebbles and Branching Programs for Tree Evaluation
ACM Transactions on Computation Theory (TOCT)
Incremental branching programs
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
On some bounds on the size of branching programs (a survey)
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
The complexity of classical and quantum branching programs: a communication complexity approach
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
Tight bounds for monotone switching networks via fourier analysis
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Hi-index | 0.00 |