3228 search results - page 397 / 646 » Computationally Sound Proofs |
124
click to vote
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
— Achieving the Nash equilibria for single objective games is known to be a computationally difficult problem. However there is a special class of equilibria called evolutionary...
115
Voted
ERSHOV
2001
Springer
15 years 8 months ago
2001
Springer
There are many different ways of proving formulas in proposition logic. Many of these can easily be characterized as forms of resolution (e.g. [12] and [9]). Others use so-called...
114
click to vote
FOCS
2000
IEEE
15 years 8 months ago
2000
IEEE
A zap is a two-round, public coin witness-indistinguishable protocol in which the first round, consisting of a message from the verifier to the prover, can be fixed “once and...
125
click to vote
STOC
2000
ACM
15 years 8 months ago
2000
ACM
We propose a new method for proving lower bounds on quantum query algorithms. Instead of a classical adversary that runs the algorithm with one input and then modifies the input,...
138
Voted
POPL
1999
ACM
15 years 8 months ago
1999
ACM
Notions of program dependency arise in many settings: security, partial evaluation, program slicing, and call-tracking. We argue that there is a central notion of dependency commo...