Bounded Depth Arithmetic Circuits: Counting and Closure
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Computational Complexity
Polynomial-size Frege and resolution proofs of st-connectivity and Hex tautologies
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Directed Planar Reachability Is in Unambiguous Log-Space
ACM Transactions on Computation Theory (TOCT)
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
The directed planar reachability problem
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.05 |