769 search results - page 58 / 154 » Where Is the Proof |
SIAMCO
2000
13 years 8 months ago
2000
We face the problem of determining a tracking domain of attraction, say the set of initial states starting from which it is possible to track reference signals in given class, for...
TCC
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...
CRYPTO
2010
Springer
13 years 10 months ago
2010
Springer
Multiparty computation protocols have been known for more than twenty years now, but due to their lack of efficiency their use is still limited in real-world applications: the goal...
FSTTCS
2008
Springer
13 years 10 months ago
2008
Springer
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...
INFORMATICALT
2007
13 years 8 months ago
2007
In this paper we consider branching time temporal logics of knowledge and belief. These logics involve the discrete time linear temporal logic operators “next” and “until” ...