CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Decision versus evaluation in algebraic complexity
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Small-space analogues of Valiant's classes
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Succinct algebraic branching programs characterizing non-uniform complexity classes
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits
Computational Complexity
Hi-index | 0.00 |
There exists a positive constant \alpha \le 1 such that for any function T(n)\leqslant n^{\alpha} and for any problem L \in BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time which decides L, except for at most a 2^{-\Omega ...