STOC
2000
ACM
14 years 3 months ago
2000
ACM
STOC
2000
ACM
14 years 3 months ago
2000
ACM
We consider a new model for computing with uncertainty. It is desired to compute a function f X1; : : : ; Xn where X1; : : : ; Xn are unknown, but guaranteed to lie in speci ed i...
STOC
2000
ACM
14 years 3 months ago
2000
ACM
STOC
2000
ACM
14 years 3 months ago
2000
ACM
We consider the design of self-testers for quantum gates. A self-tester for the gates F 1, . . . , F m is a procedure that, given any gates G1, . . . , Gm, decides with high probab...
STOC
2000
ACM
14 years 3 months ago
2000
ACM
STOC
2000
ACM
14 years 3 months ago
2000
ACM
Abstract. We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix trees...
STOC
2000
ACM
14 years 3 months ago
2000
ACM
Ï ÔÖ × ÒØ Ø ¬Ö×Ø ÓعÔÓØ ØÓ ÖÓÙØ Ò Ð ÓÖ Ø Ñ ÓÖ Ø Ò ¢Ò Ñ × Û Ó× ÖÙÒÒ Ò Ø Ñ ÓÒ ÒÝ Ö ´ º º¸ ª´Òµµ Ñ ÒݹØÓ¹ÓÒ Ø ...
STOC
2000
ACM
14 years 3 months ago
2000
ACM
STOC
2000
ACM
14 years 3 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
STOC
2000
ACM
14 years 3 months ago
2000
ACM