-
1
-
-
0033907710
-
On TC°, AC°, and arithmetic circuits
-
M. AGRAWAL, E. ALLENDER, AND S. DATTA, On TC°, AC°, and arithmetic circuits, J. Computer and System Sciences 60 (2000), pp. 395-421.
-
(2000)
J. Computer and System Sciences
, vol.60
, pp. 395-421
-
-
AGRAWAL, M.1
ALLENDER, E.2
DATTA, S.3
-
2
-
-
0042388909
-
Making computation count: Arithmetic circuits in the Nineties, in the Complexity Theory Column
-
E. ALLENDER, Making computation count: Arithmetic circuits in the Nineties, in the Complexity Theory Column, SIGACT NEWS 28 (4) (1997) pp. 2-15.
-
(1997)
SIGACT NEWS
, vol.28
, Issue.4
, pp. 2-15
-
-
ALLENDER, E.1
-
3
-
-
0042889711
-
Uniform constant-depth threshold circuits for division and iterated multiplication
-
E. ALLENDER, D. BARRINGTON, AND W. HESSE, Uniform constant-depth threshold circuits for division and iterated multiplication, J. Computer and System Sciences 65 4 (2002), pp. 695-716.
-
(2002)
J. Computer and System Sciences
, vol.65
, Issue.4
, pp. 695-716
-
-
ALLENDER, E.1
BARRINGTON, D.2
HESSE, W.3
-
4
-
-
0002507290
-
Non-commutative arithmetic circuits: Depth-reduction and depth lower bounds
-
1,2
-
E. ALLENDER, J. JIAO, M. MAHAJAN AND V. VINAY, Non-commutative arithmetic circuits: depth-reduction and depth lower bounds, Theoretical Computer Science 209 1,2 (1998), pp. 47-86.
-
(1998)
Theoretical Computer Science
, vol.209
, pp. 47-86
-
-
ALLENDER, E.1
JIAO, J.2
MAHAJAN, M.3
VINAY, V.4
-
5
-
-
0032597120
-
Isolation, matching, and counting: Uniform and nonuniform upper bounds
-
E. ALLENDER, K. REINHARDT, S. ZHOU, Isolation, matching, and counting: Uniform and nonuniform upper bounds, J. Computer and System Sciences 59 (1999), pp. 164-181.
-
(1999)
J. Computer and System Sciences
, vol.59
, pp. 164-181
-
-
ALLENDER, E.1
REINHARDT, K.2
ZHOU, S.3
-
6
-
-
0003372863
-
Algorithmic Number Theory
-
MIT Press, Cambridge, MA
-
E. BACH, J. SHALLIT, Algorithmic Number Theory, Volume I: Efficient Algorithms, MIT Press, Cambridge, MA, 1996.
-
(1996)
Efficient Algorithms
, vol.1
-
-
BACH, E.1
SHALLIT, J.2
-
8
-
-
0029322917
-
Circuits, matrices and nonassociative computation
-
M. BEAUDRY AND P. MCKENZIE, Circuits, matrices and nonassociative computation, J. Computer and System Sciences 50 (1995), pp. 441-455.
-
(1995)
J. Computer and System Sciences
, vol.50
, pp. 441-455
-
-
BEAUDRY, M.1
MCKENZIE, P.2
-
9
-
-
0039863526
-
Finite monoids: From word to circuit evaluation
-
M. BEAUDRY, P. MCKENZIE, P. PÉLADEAU, D. THÉRIEN, Finite monoids: from word to circuit evaluation, SIAM J. Computing 26 (1997), pp. 138-152.
-
(1997)
SIAM J. Computing
, vol.26
, pp. 138-152
-
-
BEAUDRY, M.1
MCKENZIE, P.2
PÉLADEAU, P.3
THÉRIEN, D.4
-
10
-
-
0026819849
-
Computing algebraic formulas using a constant number of registers
-
M. BEN-OR AND R. CLEVE, Computing algebraic formulas using a constant number of registers, SIAM J. Computing 21 1 (1992), pp. 54-58.
-
(1992)
SIAM J. Computing
, vol.21
, Issue.1
, pp. 54-58
-
-
BEN-OR, M.1
CLEVE, R.2
-
11
-
-
0026901380
-
An optimal parallel algorithm for formula evaluation
-
S. BUSS, S. COOK, A. GUPTA, V. RAMACHANDRAN, An optimal parallel algorithm for formula evaluation, SIAM J. Computing 21 (1992), pp. 755-780.
-
(1992)
SIAM J. Computing
, vol.21
, pp. 755-780
-
-
BUSS, S.1
COOK, S.2
GUPTA, A.3
RAMACHANDRAN, V.4
-
13
-
-
0032180913
-
1 computation
-
1 computation, J. Computer and System Sciences, 57 2, 1998, pp. 200-212.
-
(1998)
J. Computer and System Sciences
, vol.57
, Issue.2
, pp. 200-212
-
-
CAUSSINUS, H.1
MCKENZIE, P.2
THÉRIEN, D.3
VOLLMER, H.4
-
14
-
-
0021420850
-
Constant depth reducibility
-
A. K. CHANDRA, L. STOCKMEYER, U. VISHKIN, Constant depth reducibility, SIAM Journal on Computing 13, 1984, pp. 423-439.
-
(1984)
SIAM Journal on Computing
, vol.13
, pp. 423-439
-
-
CHANDRA, A.K.1
STOCKMEYER, L.2
VISHKIN, U.3
-
16
-
-
0021522564
-
Parallel algorithms for algebraic problems
-
J. VON ZUR GATHEN, Parallel algorithms for algebraic problems, SIAM J. on Computing 13 4 (1984), pp. 802-824.
-
(1984)
SIAM J. on Computing
, vol.13
, Issue.4
, pp. 802-824
-
-
VON ZUR GATHEN, J.1
-
17
-
-
0002711066
-
The monotone and planar circuit value problems are logspace complete for P
-
9
-
L. M. GOLDSCHLAGER, The monotone and planar circuit value problems are logspace complete for P, SIGACT News 9, 1977, pp. 25-29.
-
(1977)
SIGACT News
, pp. 25-29
-
-
GOLDSCHLAGER, L.M.1
-
18
-
-
0003557427
-
-
Oxford University Press, 336 pages
-
R. GREENLAW, J. HOOVER AND L. RUZZO, Limits to parallel computation, P-completeness theory, Oxford University Press, 1995, 336 pages.
-
(1995)
Limits to parallel computation, P-completeness theory
-
-
GREENLAW, R.1
HOOVER, J.2
RUZZO, L.3
-
19
-
-
84879517087
-
Division is in uniform TC°
-
Proceedings of the 28th International Colloquium on Automata, Languages, and Programming
-
W. HESSE, Division is in uniform TC°, Proceedings of the 28th International Colloquium on Automata, Languages, and Programming 2001, Lecture Notes in Computer Science 2076, pp. 104-114.
-
(2001)
Lecture Notes in Computer Science
, vol.2076
, pp. 104-114
-
-
HESSE, W.1
-
20
-
-
84976819141
-
Probabilistic algorithms for deciding equivalence of straight-line programs
-
O. IBARRA AND S. MORAN, Probabilistic algorithms for deciding equivalence of straight-line programs, Journal of the ACM 30 (1), 1983, pp. 217-228.
-
(1983)
Journal of the ACM
, vol.30
, Issue.1
, pp. 217-228
-
-
IBARRA, O.1
MORAN, S.2
-
21
-
-
0024091298
-
Nondeterministic space is closed under complement
-
N. IMMERMAN, Nondeterministic space is closed under complement, SIAM J. on Computing 17 (5) (1988), pp. 935-938.
-
(1988)
SIAM J. on Computing
, vol.17
, Issue.5
, pp. 935-938
-
-
IMMERMAN, N.1
-
22
-
-
84976663088
-
Logarithmic space recognition and translation of parenthesis languages
-
N. LYNCH, Logarithmic space recognition and translation of parenthesis languages, Journal of the ACM 24 (1977), pp. 583-590.
-
(1977)
Journal of the ACM
, vol.24
, pp. 583-590
-
-
LYNCH, N.1
-
23
-
-
0039469908
-
The PL hierarchy collapses
-
M. OGIHARA, The PL hierarchy collapses, SIAM Journal of Computing 27 (1998), pp. 1430-1437.
-
(1998)
SIAM Journal of Computing
, vol.27
, pp. 1430-1437
-
-
OGIHARA, M.1
-
25
-
-
0000965494
-
Separation of the monotone NC hierarchy
-
R. RAZ AND P. MCKENZIE, Separation of the monotone NC hierarchy, Combinatorica 19 3 (1999), pp. 403-435.
-
(1999)
Combinatorica
, vol.19
, Issue.3
, pp. 403-435
-
-
RAZ, R.1
MCKENZIE, P.2
-
28
-
-
0026237246
-
Properties that Characterize LOGCFL
-
H. VENKATESWARAN, Properties that Characterize LOGCFL, J. Computer and System Sciences 43, 2 (1991), pp. 380-404.
-
(1991)
J. Computer and System Sciences
, vol.43
, Issue.2
, pp. 380-404
-
-
VENKATESWARAN, H.1
-
30
-
-
84947719043
-
-
K. W. WAGNER, The complexity of problems concerning graphs with regularities, Proceedings 11th Mathematical Foundations of Computer Science (1984), Lecture Notes in Computer Science 176, pp. 544-552. Full version as TR N/84/52, Friedrich-Schiller-Universität Jena, 1984.
-
K. W. WAGNER, The complexity of problems concerning graphs with regularities, Proceedings 11th Mathematical Foundations of Computer Science (1984), Lecture Notes in Computer Science 176, pp. 544-552. Full version as TR N/84/52, Friedrich-Schiller-Universität Jena, 1984.
-
-
-
-
31
-
-
0039891908
-
Integer circuit evaluation is PSPACE-complete
-
K. YANG, Integer circuit evaluation is PSPACE-complete, J. Computer and System Sciences 63 2 (2001), pp. 288-303.
-
(2001)
J. Computer and System Sciences
, vol.63
, Issue.2
, pp. 288-303
-
-
YANG, K.1
|