3415 search results - page 153 / 683 » Lower Bounds for Kernelizations |
166
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...
134
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
In the online channel coding model, a sender wishes to communicate a message to a receiver by transmitting a codeword x = (x1, . . . , xn) ∈ {0, 1}n bit by bit via a channel lim...
134
click to vote
CRYPTO
2006
Springer
15 years 8 months ago
2006
Springer
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
128
click to vote
JCT
2011
14 years 11 months ago
2011
We find sharp absolute constants C1 and C2 with the following property: every well-rounded lattice of rank 3 in a Euclidean space has a minimal basis so that the solid angle spann...
126
Voted
ICALP
1994
Springer
15 years 8 months ago
1994
Springer
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...