AAAAAA
Results:
1-7
|
Results: 7
Authors:
Allender, E
Saks, M
Shparlinski, I
Citation: E. Allender et al., A lower bound for primality, J COMPUT SY, 62(2), 2001, pp. 356-366
Authors:
Mundhenk, M
Goldsmith, J
Lusena, C
Allender, E
Citation: M. Mundhenk et al., Complexity of finite-horizon Markov decision process problems, J ACM, 47(4), 2000, pp. 681-720
Authors:
Reinhardt, K
Allender, E
Citation: K. Reinhardt et E. Allender, Making nondeterminism unambiguous, SIAM J COMP, 29(4), 2000, pp. 1118-1131
Authors:
Agrawal, M
Allender, E
Datta, S
Citation: M. Agrawal et al., On TC0, AC(0), and arithmetic circuits, J COMPUT SY, 60(2), 2000, pp. 395-421
Authors:
Allender, E
Citation: E. Allender, The permanent requires large uniform threshold circuits, CH J THEOR, (7), 1999, pp. 1-19
Authors:
Allender, E
Beals, R
Ogihara, M
Citation: E. Allender et al., The complexity of matrix rank and feasible systems of linear equations, COMP COMPLE, 8(2), 1999, pp. 99-126
Authors:
Allender, E
Reinhardt, K
Zhou, SY
Citation: E. Allender et al., Isolation, matching, and counting uniform and nonuniform upper bounds, J COMPUT SY, 59(2), 1999, pp. 164-181
Risultati:
1-7
|