( en | de | ru )

 

Disambiguation of "Allender, Eric"

Author of the publication

copydeleteadd this publication to your clipboard
Other Complexity Classes and Measures.

, , and . Algorithms and Theory of Computation Handbook, CRC Press, (1999)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ull Erich

Hauke Erichsen

Gerda Erich

Klaus Erichson

Badrian Erich

 

Other publications of authors with the same name

Circuit Complexity, Kolmogorov Complexity, and Prospects for Lower Bounds.. DCFS, page 7-13. University of Prince Edward Island, (2008)What Can be Efficiently Reduced to the K-Random Strings?, , and . STACS, volume 2996 of Lecture Notes in Computer Science, page 584-595. Springer, (2004)Reducibility and Completeness., , and . Algorithms and Theory of Computation Handbook, CRC Press, (1999)The future of computational complexity theory: part II., , , , and . SIGACT News, 27 (4): 3-7 (1996)Depth reduction for noncommutative arithmetic circuits., and . STOC, page 515-522. ACM, (1993)The Complexity of Matrix Rank and Feasible Systems of Linear Equations (Extended Abstract)., , and . STOC, page 161-167. ACM, (1996)On the Complexity of Numerical Analysis., , , and . SIAM J. Comput., 38 (5): 1987-2006 (2009)Reachability Problems: An Update.. CiE, volume 4497 of Lecture Notes in Computer Science, page 25-27. Springer, (2007)On the power of algebraic branching programs of width two., and . Comput. Complex., 25 (1): 217-253 (2016)NL-printable sets and nondeterministic Kolmogorov complexity.. Theor. Comput. Sci., 355 (2): 127-138 (2006)