199 search results - page 28 / 40 » Denotations for Classical Proofs - Preliminary Results |
105
click to vote
IWOCA
2009
Springer
15 years 6 months ago
2009
Springer
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...
109
click to vote
COCO
2000
Springer
15 years 4 months ago
2000
Springer
For any q > 1, let MODq be a quantum gate that determines if the number of 1’s in the input is divisible by q. We show that for any q, t > 1, MODq is equivalent to MODt (u...
100
click to vote
CRYPTO
2005
Springer
15 years 5 months ago
2005
Springer
We study the question whether the sequential or parallel composition of two functions, each indistinguishable from a random function by non-adaptive distinguishers is secure agains...
88
Voted
EUROCRYPT
2005
Springer
15 years 5 months ago
2005
Springer
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding ...
108
click to vote
PPDP
2007
Springer
15 years 5 months ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...