769 search results - page 50 / 154 » Where Is the Proof |
140
Voted
QCQC
1998
Springer
15 years 9 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...
128
click to vote
FORMATS
2004
Springer
15 years 8 months ago
2004
Springer
This paper presents assume-guarantee style substitutivity results for the recently published timed I/O automaton modeling framework. These results are useful for decomposing verifi...
146
click to vote
EUROCRYPT
2000
Springer
15 years 8 months ago
2000
Springer
We show that if any one-way function exists, then 3-round concurrent zero-knowledge arguments for all NP problems can be built in a model where a short auxiliary string with a pres...
139
click to vote
FLOPS
2008
Springer
15 years 6 months ago
2008
Springer
Bundy and Richardson [7] presented a technique for reasoning about lists using ellipsis (the dots in 1+2+...+10), where a polymorphic function, denoted by 2, is used to encapsulate...
147
click to vote
GECCO
2008
Springer
15 years 6 months ago
2008
Springer
Proofs and empirical evidence are presented which show that a subset of algorithms can have identical performance over a subset of functions, even when the subset of functions is ...