Obserwuj
Eric Allender
Eric Allender
Rutgers University
Zweryfikowany adres z cs.rutgers.edu - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Uniform constant-depth threshold circuits for division and iterated multiplication
W Hesse, E Allender, DAM Barrington
Journal of Computer and System Sciences 65 (4), 695-716, 2002
2472002
Complexity of finite-horizon Markov decision process problems
M Mundhenk, J Goldsmith, C Lusena, E Allender
Journal of the ACM (JACM) 47 (4), 681-720, 2000
245*2000
On the complexity of numerical analysis
E Allender, P Bürgisser, J Kjeldgaard-Pedersen, PB Miltersen
SIAM Journal on Computing 38 (5), 1987-2006, 2008
1962008
P-printable sets
EW Allender, RS Rubinstein
SIAM Journal on Computing 17 (6), 1193-1202, 1988
1681988
Power from random strings
E Allender, H Buhrman, M Koucky, D Melkebeek, D Ronneburger
SIAM Journal on Computing 35 (6), 1467-1493, 2006
163*2006
Relationships among PL,# L, and the determinant
E Allender, M Ogihara
Structure in Complexity Theory Conference, 1994., Proceedings of the Ninth …, 1994
1621994
A note on the power of threshold circuits
E Allender
30th Annual Symposium on Foundations of Computer Science, 580-584, 1989
1621989
Making nondeterminism unambiguous
E Allender, K Reinhardt
SIAM J. Comp 29 (4), 1118-1131, 2000
159*2000
Non-commutative arithmetic circuits: depth reduction and size lower bounds
E Allender, J Jiao, M Mahajan, V Vinay
Theoretical Computer Science 209 (1-2), 47-86, 1998
127*1998
The complexity of sparse sets in P: Preliminary report
EW Allender
Structure in Complexity Theory: Proceedings of the Conference held at the …, 1986
1251986
The complexity of matrix rank and feasible systems of linear equations
E Allender, R Beals, M Ogihara
Proceedings of the twenty-eighth annual ACM symposium on theory of computing …, 1996
1191996
Isolation, matching, and counting uniform and nonuniform upper bounds
E Allender, K Reinhardt, S Zhou
Journal of Computer and System Sciences 59 (2), 164-181, 1999
112*1999
Measure on small complexity classes, with applications for BPP
E Allender, M Strauss
Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on …, 1994
1001994
Amplifying lower bounds by means of self-reducibility
E Allender, M Koucký
Journal of the ACM (JACM) 57 (3), 1-36, 2010
982010
Arithmetic circuits and counting complexity classes
E Allender
Complexity of Computations and Proofs, Quaderni di Matematica 13, 33-72, 2004
98*2004
The complexity of satisfiability problems: Refining Schaefer's theorem
E Allender, M Bauland, N Immerman, H Schnoor, H Vollmer
Journal of Computer and System Sciences 75 (4), 245-254, 2009
93*2009
Minimizing Disjunctive Normal Form Formulas and Circuits Given a Truth Table
E Allender, L Hellerstein, P McCabe, T Pitassi, M Saks
SIAM Journal on Computing 38, 63, 2008
91*2008
The complexity of planarity testing
E Allender, M Mahajan
Information and Computation 189 (1), 117-134, 2004
85*2004
Planar and grid graph reachability problems
E Allender, DA Mix Barrington, T Chakraborty, S Datta, S Roy
Theory of Computing Systems 45 (4), 675-723, 2009
84*2009
On TC 0, AC 0, and arithmetic circuits
M Agrawal, E Allender, S Datta
Journal of Computer and System Sciences 60 (2), 395-421, 2000
822000
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20