169 search results - page 28 / 34 » Which Languages Have 4-Round Zero-Knowledge Proofs |
COCO
2004
Springer
13 years 11 months ago
2004
Springer
Juedes and Lutz (1995) proved a small span theorem for polynomial-time many-one reductions in exponential time. This result says that for language A decidable in exponential time,...
PODS
2004
ACM
14 years 7 months ago
2004
ACM
The important challenge of evaluating XPath queries over XML streams has sparked much interest in the past few years. A number of algorithms have been proposed, supporting wider f...
WWW
2004
ACM
14 years 8 months ago
2004
ACM
The vision of the Semantic Web is to reduce manual discovery and usage of Web resources (documents and services) and to allow software agents to automatically identify these Web r...
COORDINATION
2009
Springer
14 years 8 months ago
2009
Springer
Process algebras are a set of mathematically rigourous languages with well defined semantics that permit modelling behaviour of concurrent and communicating systems. Verification o...
APSEC
2008
IEEE
14 years 2 months ago
2008
IEEE
Memory usage analysis is an important problem for resource-constrained mobile devices, especially under mission- or safety-critical circumstances. Program codes running on or bein...