Sciweavers

923 search results - page 16 / 185
» On a generalization of Stickelberger's Theorem
Sort
View
TCC
2010
Springer
121views Cryptology» more  TCC 2010»
14 years 7 months ago
An Efficient Parallel Repetition Theorem
Abstract. We present a general parallel-repetition theorem with an efficient reduction. As a corollary of this theorem we establish that parallel repetition reduces the soundness e...
Johan Håstad, Rafael Pass, Douglas Wikstr&ou...
CORR
2011
Springer
247views Education» more  CORR 2011»
14 years 1 months ago
The Extraordinary SVD
: We review the singular value decomposition (SVD) and discuss some lesser-known applications of it that we find particularly interesting. We also discuss generalizations of the S...
Carla D. Martin, Mason A. Porter
CSFW
2012
IEEE
12 years 12 months ago
Generic Indifferentiability Proofs of Hash Designs
—In this paper, we propose a formal analysis of domain extenders for hash functions in the indifferentiability framework. We define a general model for domain extenders and prov...
Marion Daubignard, Pierre-Alain Fouque, Yassine La...
JSYML
2010
62views more  JSYML 2010»
14 years 8 months ago
A monotonicity theorem for dp-minimal densely ordered groups
Dp-minimality is a common generalization of weak minimality and weak o-minimality. If T is a weakly o-minimal theory then it is dp-minimal (Fact 2.2), but there are dp-minimal den...
John Goodrick
71
Voted
ENTCS
2007
109views more  ENTCS 2007»
14 years 9 months ago
Free Theorems and Runtime Type Representations
’s abstraction theorem [21], often referred to as the parametricity theorem, can be used to derive properties about functional programs solely from their types. Unfortunately, i...
Dimitrios Vytiniotis, Stephanie Weirich