Theoretical Computer Science
Bounded Depth Arithmetic Circuits: Counting and Closure
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
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
On TC/sup 0/, AC/sup 0/, and Arithmetic Circuits
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Approximation of boolean functions by combinatorial rectangles
Theoretical Computer Science
The complexity of tensor calculus
Computational Complexity
NL-printable sets and nondeterministic Kolmogorov complexity
Theoretical Computer Science - Logic, language, information and computation
The Complexity of Tensor Circuit Evaluation
Computational Complexity
Characterizing Valiant's algebraic complexity classes
Journal of Complexity
Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Arithmetizing classes around NC1and L
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Circuits and context-free languages
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in
Proceedings of the forty-second ACM symposium on Theory of computing
Counting paths in VPA Is complete for #NC1
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Characterizing valiant's algebraic complexity classes
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Arithmetic circuits: The chasm at depth four gets wider
Theoretical Computer Science
| Hi-index | 5.23 |