13306 search results - page 352 / 2662 » Theoretical Computer Science |
199
click to vote
TCS
2012
14 years 2 months ago
2012
Abstract. The standard simulation of a nondeterministic Turing machine (NTM) by a deterministic one essentially searches a large boundeddegree graph whose size is exponential in th...
175
click to vote
GI
2001
Springer
15 years 11 months ago
2001
Springer
: As mobile and embedded computing devices become more pervasive, it is becoming obvious that the nature of interactions between users and computers must evolve. Applications need ...
175
click to vote
ACMSE
2006
ACM
15 years 10 months ago
2006
ACM
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...
178
click to vote
CSE
2009
IEEE
15 years 10 months ago
2009
IEEE
There are many applications for Secure Multi-Party Computation (SMC), but practical adoption is still an issue. One reason is that the business model of the application does not m...