Random lattices and a conjectured 0 - 1 law about their polynomial time computable properties
- Miklós Ajtai
- 2002
- FOCS 2002
Publications
Date
Featured collections
Popular topics
46 results for Miklós Ajtai
Sampling short lattice vectors and the closest lattice vector problem
- Miklós Ajtai
- Ravi Kumar
- et al.
- 2002
- CCC 2002
Approximate counting of inversions in a data stream
- Miklós Ajtai
- T.S. Jayram
- et al.
- 2002
- STOC 2002
The invasiveness of off-line memory checking
- Miklós Ajtai
- 2002
- STOC 2002
A sieve algorithm for the shortest lattice vector problem
- Miklos Ajtai
- R. Kumar
- et al.
- 2001
- STOC 2001
Non-linear time lower bound for Boolean branching programs
- Miklos Ajtai
- 1999
- FOCS 1999
Determinism versus non-determinism for linear time RAMs
- Miklos Ajtai
- 1999
- STOC 1999
Closure of monadic NP
- Miklos Ajtai
- Ronald Fagin
- et al.
- 1998
- STOC 1998
Shortest vector problem in L2 is NP-hard for randomized reductions
- Miklos Ajtai
- 1998
- STOC 1998
Public-key cryptosystem with worst-case/average-case equivalence
- Miklos Ajtai
- Cynthia Dwork
- 1997
- STOC 1997