Share This Author
Complexity Theory
- E. Allender, M. Loui, Kenneth W. Regan
- Computer ScienceEncyclopedia of Cryptography and Security
- 1997
TLDR
On the complexity of numerical analysis
- E. Allender, Peter BĂĽrgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen
- Mathematics21st Annual IEEE Conference on Computational…
- 16 July 2006
TLDR
Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds
- E. Allender, Jia Jiao, M. Mahajan, V. Vinay
- Mathematics, Computer ScienceTheor. Comput. Sci.
- 7 February 1996
Uniform constant-depth threshold circuits for division and iterated multiplication
- W. Hesse, E. Allender, D. M. Barrington
- Computer Science, MathematicsJ. Comput. Syst. Sci.
- 1 December 2002
The complexity of matrix rank and feasible systems of linear equations
- E. Allender, R. Beals, M. Ogihara
- Computer ScienceSTOC '96
- 1 July 1996
TLDR
A note on the power of threshold circuits
- E. Allender
- Computer Science30th Annual Symposium on Foundations of Computer…
- 30 October 1989
The author presents a very simple proof of the fact that any language accepted by polynomial-size depth-k unbounded-fan-in circuits of AND and OR gates is accepted by depth-three threshold circuits…
The complexity of satisfiability problems: Refining Schaefer's theorem
- E. Allender, Michael Bauland, N. Immerman, Henning Schnoor, H. Vollmer
- MathematicsJ. Comput. Syst. Sci.
- 29 August 2005
The Permanent Requires Large Uniform Threshold Circuits
- E. Allender
- Computer ScienceChic. J. Theor. Comput. Sci.
- 1999
TLDR
Complexity of finite-horizon Markov decision process problems
- M. Mundhenk, J. Goldsmith, Christopher Lusena, E. Allender
- Computer Science, MathematicsJACM
- 1 July 2000
TLDR
Measure on small complexity classes, with applications for BPP
- E. Allender, M. Strauss
- Computer ScienceProceedings 35th Annual Symposium on Foundations…
- 20 November 1994
TLDR
...
...