Login
|
New Account
AAAAAA
ITA
ENG
Results:
1-3
|
Results: 3
The communication complexity of enumeration, elimination, and selection
Authors:
Ambainis, A Buhrman, H Gasarch, W Kalyanasundaram, B Torenvliet, L
Citation:
A. Ambainis et al., The communication complexity of enumeration, elimination, and selection, J COMPUT SY, 63(2), 2001, pp. 148-185
Randomness is hard
Authors:
Buhrman, H Torenvliet, L
Citation:
H. Buhrman et L. Torenvliet, Randomness is hard, SIAM J COMP, 30(5), 2000, pp. 1485-1501
Separating complexity classes using autoreducibility
Authors:
Buhrman, H Fortnow, L van Melkebeek, D Torenvliet, L
Citation:
H. Buhrman et al., Separating complexity classes using autoreducibility, SIAM J COMP, 29(5), 2000, pp. 1497-1520
Risultati:
1-3
|