The Complexity of Tensor Circuit Evaluation
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Paths Problems in Symmetric Logarithmic Space
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Space Efficient Algorithms for Series-Parallel Graphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
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 complexity of tensor calculus
Computational Complexity
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
Space efficient algorithms for directed series-parallel graphs
Journal of Algorithms
The Complexity of Tensor Circuit Evaluation
Computational Complexity
Theoretical Computer Science
Amplifying lower bounds by means of self-reducibility
Journal of the ACM (JACM)
Arithmetizing classes around NC1and L
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Logspace algorithms for computing shortest and longest paths in series-parallel graphs
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Counting paths in VPA Is complete for #NC1
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
A generalization of spira's theorem and circuits with small segregators or separators
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
The lower reaches of circuit uniformity
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Log-Space Algorithms for Paths and Matchings in k-Trees
Theory of Computing Systems
Monomials, multilinearity and identity testing in simple read-restricted circuits
Theoretical Computer Science
Hi-index | 0.00 |