Uniform constant-depth threshold circuits for division and iterated multiplication
Journal of Computer and System Sciences - Complexity 2001
Finite Automata with Generalized Acceptance Criteria
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
Arithmetic Circuits and Polynomial Replacement Systems
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Functions computable in polynomial space
Information and Computation
Languages to diagonalize against advice classes
Computational Complexity
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers
Computational Complexity
Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Amplifying lower bounds by means of self-reducibility
Journal of the ACM (JACM)
Functions computable in polynomial space
Information and Computation
Complexity theory made easy: the formal language approach to the definition of complexity classes
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Arithmetizing classes around NC1and L
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Estimating the size of neural networks from the number of available training data
ICANN'07 Proceedings of the 17th international conference on Artificial neural networks
Small-space analogues of Valiant's classes
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Cracks in the defenses: scouting out approaches on circuit lower bounds
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
On the complexity of membership and counting in height-deterministic pushdown automata
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
On the complexity of membership and counting in height-deterministic pushdown automata
Journal of Automata, Languages and Combinatorics
Leaf languages and string compression
Information and Computation
On the power of algebraic branching programs of width two
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Counting classes and the fine structure between NC1 and L
Theoretical Computer Science
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
On the complexity of matrix rank and rigidity
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits
Computational Complexity
| Hi-index | 0.00 |