3172 search results - page 171 / 635 » On the Random-Self-Reducibility of Complete Sets |
294
click to vote
POPL
2004
ACM
16 years 6 months ago
2004
ACM
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
147
click to vote
RECOMB
2005
Springer
16 years 6 months ago
2005
Springer
In the half-century since the C-value paradox (the apparent lack of correlation between organismal genome size and morphological complexity) was described, there have been no expli...
179
click to vote
CADE
2007
Springer
16 years 6 months ago
2007
Springer
Abstract. In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equ...
257
click to vote
CADE
2002
Springer
16 years 6 months ago
2002
Springer
Abstract. Description Logics are a family of class based knowledge representation formalisms characterised by the use of various constructors to build complex classes from simpler ...
191
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...