AAAAAA
Results:
1-9
|
Results: 9
Authors:
ALLENDER E
LANGE KJ
Citation: E. Allender et Kj. Lange, RUSPACE(LOG N) SUBSET-OF DSPACE(LOG(2)-N-LOG-LOG-N), theory of computing systems, 31(5), 1998, pp. 539-550
Authors:
ALLENDER E
JIAO J
MAHAJAN M
VINAY V
Citation: E. Allender et al., NONCOMMUTATIVE ARITHMETIC CIRCUITS - DEPTH REDUCTION AND SIZE LOWER BOUNDS, Theoretical computer science, 209(1-2), 1998, pp. 47-86
Authors:
AGRAWAL M
ALLENDER E
RUDICH S
Citation: M. Agrawal et al., REDUCTIONS IN CIRCUIT COMPLEXITY - AN ISOMORPHISM THEOREM AND A GAP THEOREM, Journal of computer and system sciences (Print), 57(2), 1998, pp. 127-143
Authors:
ALLENDER E
BALCAZAR J
IMMERMAN N
Citation: E. Allender et al., A FIRST-ORDER ISOMORPHISM THEOREM, SIAM journal on computing, 26(2), 1997, pp. 557-567
Authors:
ALLENDER E
Citation: E. Allender, 10TH ANNUAL CONFERENCE ON STRUCTURE IN COMPLEXITY 1995 - EDITORS FOREWORD, Journal of computer and system sciences, 54(3), 1997, pp. 381-381
Authors:
ALLENDER E
OGIHARA M
Citation: E. Allender et M. Ogihara, RELATIONSHIPS AMONG PL, NUMBER-L, AND THE DETERMINANT, Informatique theorique et applications, 30(1), 1996, pp. 1-21
Authors:
ALLENDER E
HERTRAMPF U
Citation: E. Allender et U. Hertrampf, DEPTH REDUCTION FOR CIRCUITS OF UNBOUNDED FAN-IN, Information and computation, 112(2), 1994, pp. 217-238
Authors:
ALLENDER E
GORE V
Citation: E. Allender et V. Gore, A UNIFORM CIRCUIT LOWER-BOUND FOR THE PERMANENT, SIAM journal on computing, 23(5), 1994, pp. 1026-1049
Authors:
ALLENDER E
BEIGEL R
HERTRAMPF U
HOMER S
Citation: E. Allender et al., ALMOST-EVERYWHERE COMPLEXITY HIERARCHIES FOR NONDETERMINISTIC TIME, Theoretical computer science, 115(2), 1993, pp. 225-241
Risultati:
1-9
|