169 search results - page 34 / 34 » Which Languages Have 4-Round Zero-Knowledge Proofs |
147
click to vote
PODS
2007
ACM
16 years 4 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
174
click to vote
ZUM
1997
Springer
15 years 8 months ago
1997
Springer
We present a new formal OO method, called FOX, which is a synergetic combination of the semi-formal Fusion method and the formal specification language Object-Z. To manage complex...
161
click to vote
WWW
2003
ACM
16 years 5 months ago
2003
ACM
The binary form of an image does not tell what the image is about. It is possible to retrieve images from a database using pattern matching techniques, but usually textual descript...
180
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...