Login
|
New Account
AAAAAA
ITA
ENG
Results:
1-2
|
Results: 2
THE ASYMPTOTIC COMPLEXITY OF MERGING NETWORKS
Authors:
MILTERSEN PB PATERSON M TARUI J
Citation:
Pb. Miltersen et al., THE ASYMPTOTIC COMPLEXITY OF MERGING NETWORKS, Journal of the ACM, 43(1), 1996, pp. 147-165
PROBABILISTIC POLYNOMIALS, AC(0) FUNCTIONS AND THE POLYNOMIAL-TIME HIERARCHY
Authors:
TARUI J
Citation:
J. Tarui, PROBABILISTIC POLYNOMIALS, AC(0) FUNCTIONS AND THE POLYNOMIAL-TIME HIERARCHY, Theoretical computer science, 113(1), 1993, pp. 167-183
Risultati:
1-2
|