152 search results - page 2 / 31 » Constructive Proofs of Concentration Bounds |
ICALP
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We investigate a general paradigm for constructing arbitraryinput-length (AIL) MACs from fixed-input-length (FIL) MACs, define the waste as the relevant efficiency para...
ENDM
2008
13 years 6 months ago
2008
For a family F of graphs, a graph U is said to be F-universal if every graph of F is a subgraph of U. Similarly, a graph is said to be F-induced-universal if every graph of F is a...
FOCS
2008
IEEE
14 years 14 days ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
CRYPTO
2005
Springer
13 years 11 months ago
2005
Springer
We investigate methods for providing easy-to-check proofs of computational effort. Originally intended for discouraging spam, the concept has wide applicability as a method for co...
AML
2008
13 years 6 months ago
2008
A new approach to defining complexity of propositional formulas and proofs is suggested. Instead of measuring the size of these syntactical structures in the propositional languag...