AAAAAA
Results:
1-8
|
Results: 8
Authors:
Ambainis, A
de Wolf, R
Citation: A. Ambainis et R. De Wolf, Average-case quantum query complexity, J PHYS A, 34(35), 2001, pp. 6741-6754
Authors:
Ambainis, A
Citation: A. Ambainis, Probabilistic inductive inference: a survey, THEOR COMP, 264(1), 2001, pp. 155-167
Authors:
Ambainis, A
Apsitis, K
Freivalds, R
Smith, CH
Citation: A. Ambainis et al., Hierarchies of probabilistic and team FIN-learning, THEOR COMP, 261(1), 2001, pp. 91-117
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
Authors:
Ambainis, A
Citation: A. Ambainis, On learning formulas in the limit and with assurance, INF PROCESS, 77(1), 2001, pp. 9-11
Authors:
Ambainis, A
Citation: A. Ambainis, How rich is the structure of the intrinsic complexity of learning, INF PROCESS, 75(3), 2000, pp. 109-112
Authors:
Ambainis, A
Jain, S
Sharma, A
Citation: A. Ambainis et al., Ordinal mind change complexity of language identification, THEOR COMP, 220(2), 1999, pp. 323-343
Authors:
Ambainis, A
Citation: A. Ambainis, Note on quantum black-box complexity of almost all Boolean functions, INF PROCESS, 71(1), 1999, pp. 5-7
Risultati:
1-8
|