AAAAAA
Results:
1-8
|
Results: 8
Authors:
BUHRMAN H
KADIN J
THIERAUF T
Citation: H. Buhrman et al., FUNCTIONS COMPUTABLE WITH NONADAPTIVE QUERIES TO NP, theory of computing systems, 31(1), 1998, pp. 77-92
Authors:
BUHRMAN H
HOENE A
TORENVLIET L
Citation: H. Buhrman et al., SPLITTINGS, ROBUSTNESS, AND STRUCTURE OF COMPLETE-SETS, SIAM journal on computing, 27(3), 1998, pp. 637-653
Authors:
CLEVE R
BUHRMAN H
Citation: R. Cleve et H. Buhrman, SUBSTITUTING QUANTUM ENTANGLEMENT FOR COMMUNICATION, Physical review. A, 56(2), 1997, pp. 1201-1204
Authors:
BUHRMAN H
MAYORDOMO E
Citation: H. Buhrman et E. Mayordomo, AN EXCURSION TO THE KOLMOGOROV RANDOM STRINGS, Journal of computer and system sciences, 54(3), 1997, pp. 393-399
Authors:
BUHRMAN H
TORENVLIET L
Citation: H. Buhrman et L. Torenvliet, P-SELECTIVE SELF-REDUCIBLE SETS - A NEW CHARACTERIZATION OF P, Journal of computer and system sciences, 53(2), 1996, pp. 210-217
Authors:
BUHRMAN H
ORPONEN P
Citation: H. Buhrman et P. Orponen, RANDOM STRINGS MAKE HARD INSTANCES, Journal of computer and system sciences, 53(2), 1996, pp. 261-266
Authors:
BUHRMAN H
HEMASPAANDRA E
LONGPRE L
Citation: H. Buhrman et al., SPARSE REDUCES CONJUNCTIVELY TO TALLY, SIAM journal on computing, 24(4), 1995, pp. 673-681
Authors:
BUHRMAN H
TORENVLIET L
BOAS PV
Citation: H. Buhrman et al., 20 QUESTIONS TO A P-SELECTOR, Information processing letters, 48(4), 1993, pp. 201-204
Risultati:
1-8
|