2446 search results - page 401 / 490 » Choiceless Polynomial Time |
PODC
2009
ACM
14 years 8 months ago
2009
ACM
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
STOC
1993
ACM
13 years 11 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
STOC
1994
ACM
13 years 11 months ago
1994
ACM
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
PODC
2010
ACM
13 years 11 months ago
2010
ACM
A token is hidden in one of several boxes and then the boxes are locked. The probability of placing the token in each of the boxes is known. A searcher is looking for the token by...
DSN
2004
IEEE
13 years 11 months ago
2004
IEEE
We concentrate on automated synthesis of multitolerant programs, i.e., programs that tolerate multiple classes of faults and provide a (possibly) different level of fault-toleranc...