#### Filter Results:

- Full text PDF available (42)

#### Publication Year

1978

2013

- This year (0)
- Last 5 years (1)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Miklós Ajtai
- Electronic Colloquium on Computational Complexity
- 1996

We give a random class of lattices in Z n so that, if there is a probabilistic polynomial time algorithm which nds a short vector in a random lattice with a probability of at least 1 2 then there is also a probabilistic polynomial time algorithm which solves the following three lattice problems in every lattice in Z n with a probability exponentially close… (More)

- Miklós Ajtai
- STOC
- 1996

We give a random class of lattices in Zn whose elements can be generated together with a short vector in them so that, if there is a probabilistic polynomial time algorithm which finds a short vector in a random lattice with a probability of at least ~ then there is also a probabilistic polynomial time algorithm which solves the following three lattice… (More)

- Miklós Ajtai, János Komlós, Endre Szemerédi
- STOC
- 1983

The purpose of this paper is to describe a sorting network of size 0(n log n) and depth 0(log n).
A natural way of sorting is through consecutive halvings: determine the upper and lower halves of the set, proceed similarly within the halves, and so on. Unfortunately, while one can halve a set using only 0(n) comparisons, this cannot be done in less than… (More)

- Miklós Ajtai, Cynthia Dwork
- STOC
- 1996

We present a probabilistic public key cryptosystem which is secure unless the worst case of the following lattice problem can be solved in polynomial time: “Find the shortest nonzero vector in an n dimensional lattice L where the shortest vector v is unique in the sense that any other vector whose length is at most n’ [lull is parallel to v.”

- Miklós Ajtai, Ravi Kumar, D. Sivakumar
- STOC
- 2001

We present a randomized 2^{<italic>O(n)</italic>} time algorithm to compute a shortest non-zero vector in an <italic>n</italic>-dimensional rational lattice. The best known time upper bound for this problem was 2^{<italic>O(n</italic>\log <italic>n</italic>)} first given by Kannan [7] in 1983. We obtain several consequences of this algorithm for related… (More)

- Miklós Ajtai
- Combinatorica
- 1988

The Pigeonhole Principle for n is the statement that there is no one-to-one function between a set of size n and a set of size n 1. This statement can be formulated as an unlimited fan-in constant depth polynomial size Boolean formula PHPn in n ( n 1 ) variables. We may think that the truth-value of the variable xi, j will be true iff the function maps the… (More)

- Miklós Ajtai, János Komlós, Endre Szemerédi
- J. Comb. Theory, Ser. A
- 1980

- Miklós Ajtai, János Komlós, Endre Szemerédi
- STOC
- 1987

In this paper we show that a wide class of probabilistic algorithms can be simulated by deterministic algorithms. Namely if there is a test in LOGSPACE so that a random sequence of length (log <italic>n</italic>)<supscrpt>2</supscrpt> / log log <italic>n</italic> passes the test with probability at least 1/<italic>n</italic> then a deterministic sequence… (More)

- Miklós Ajtai, János Komlós, Endre Szemerédi
- Combinatorica
- 1983

- Miklós Ajtai, Michael Ben-Or
- STOC
- 1984

1. In t roduc t ion I{t~txml, ly there has been much interest ill tht, comput:Ltional power of circuits o1' bounded dt;pth. In particular Furst, Saxe and Sipser [FSS], and indcpentlently Ajtai [Aj] in a different form, have shown that no polynomial size circuits of bounded depth can compute the parity function of n boolean variables (and other related… (More)