1450 search results - page 138 / 290 » On the Complexity of Hardness Amplification |
166
click to vote
TCC
2007
Springer
16 years 16 days 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...
174
click to vote
TGC
2007
Springer
16 years 16 days ago
2007
Springer
Distributed applications can be structured using sessions that specify flows of messages between roles. We design a small specific language to declare sessions. We then build a c...
175
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
188
click to vote
NGITS
1999
Springer
15 years 10 months ago
1999
Springer
As the requirements for system analysis and design become more complex, the need for a natural, yet formal way of specifying system analysis findings and design decisions are becom...
189
click to vote
DOLAP
2006
ACM
15 years 10 months ago
2006
ACM
As more and more information is available on the web, it is a problem that many web resources are not accessible, i.e., are not usable for users with special needs. For example, f...