233 search results - page 9 / 47 » Interactive Proofs For Quantum Computations |
112
click to vote
CEAS
2005
Springer
15 years 1 months ago
2005
Springer
Human interaction proofs (HIPs) have become commonplace on the internet for protecting free online services from abuse by automated scripts/bots. They are challenges designed to b...
103
click to vote
AISC
2008
Springer
15 years 1 months ago
2008
Springer
Graph-based formalisms of quantum computation provide an abstract and symbolic way to represent and simulate computations. However, manual manipulation of such graphs is slow and e...
104
click to vote
CSL
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
STOC
2002
ACM
15 years 12 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
QCQC
1998
Springer
15 years 3 months ago
1998
Springer
Abstract. We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of partic...