Sparse sets and collapse of complexity classes
Information and Computation
Uniform constant-depth threshold circuits for division and iterated multiplication
Journal of Computer and System Sciences - Complexity 2001
The Complexity of Membership Problems for Circuits over Sets of Natural Numbers
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
The combinatorial approach yields an NC algorithm for computing Pfaffians
Discrete Applied Mathematics
NL-printable sets and nondeterministic Kolmogorov complexity
Theoretical Computer Science - Logic, language, information and computation
Reachability Problems: An Update
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Directed Planar Reachability Is in Unambiguous Log-Space
ACM Transactions on Computation Theory (TOCT)
The Simple Reachability Problem in Switch Graphs
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Planarity, Determinants, Permanents, and (Unique) Matchings
ACM Transactions on Computation Theory (TOCT)
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
The polynomially bounded perfect matching problem is in NC2
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Longest paths in planar DAGs in unambiguous logspace
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
On the Power of Isolation in Planar Graphs
ACM Transactions on Computation Theory (TOCT)
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
The directed planar reachability problem
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
On the bipartite unique perfect matching problem
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
The complexity of solving linear equations over a finite ring
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Space complexity of perfect matching in bounded genus bipartite graphs
Journal of Computer and System Sciences
Green's theorem and isolation in planar graphs
Information and Computation
Unambiguous Functions in Logarithmic Space
Fundamenta Informaticae
Planarity, determinants, permanents, and (unique) matchings
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Computational Complexity
| Hi-index | 0.03 |