2412 search results - page 49 / 483 » Which Problems Have Strongly Exponential Complexity |
97
Voted
FOCS
2007
IEEE
15 years 7 months ago
2007
IEEE
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixedparameter tractable. We consider proofs that witness that a given prop...
113
Voted
CORR
2010
Springer
15 years 22 days ago
2010
Springer
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
119
click to vote
CANS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. In this paper we study Perfectly Secure Message Transmission (PSMT) between a sender S and a receiver R, connected in a directed synchronous network through multiple para...
120
Voted
IACR
2011
14 years 8 days ago
2011
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
131
Voted
CRYPTO
2011
Springer
14 years 13 days ago
2011
Springer
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...