325 search results - page 14 / 65 » Proofs of Restricted Shuffles |
112
click to vote
FROCOS
2005
Springer
15 years 5 months ago
2005
Springer
ATS is a language with a highly expressive type system that supports a restricted form of dependent types in which programs are not allowed to appear in type expressions. The langu...
105
click to vote
STOC
2006
ACM
16 years 2 days 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...
COCO
2009
Springer
15 years 6 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
ORL
2008
14 years 11 months ago
2008
We discuss the almost-sure convergence of a broad class of sampling algorithms for multi-stage stochastic linear programs. We provide a convergence proof based on the finiteness o...
ESOP
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The hiding of internal invariants creates a mismatch between procedure specifications in an interface and proof obligations on the implementations of those procedures. T...