• Publications
  • Influence
On Lovász’ lattice reduction and the nearest lattice point problem
  • L. Babai
  • Mathematics, Computer Science
  • Comb.
  • 1986
Answering a question of Vera Sós, we show how Lovász’ lattice reduction can be used to find a point of a given lattice, nearest within a factor ofcd (c = const.) to a given point in Rd. We prove thatExpand
A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem
TLDR
A technique due to A. Joffe (1974) is applied and deterministic construction in fast parallel time of various combinatorial objects whose existence follows from probabilistic arguments is obtained. Expand
Trading group theory for randomness
  • L. Babai
  • Mathematics, Computer Science
  • STOC '85
  • 1 December 1985
TLDR
The aim of this paper is to replace most of the (proven and unproven) group theory of [BS] by elementary combinatorial arguments and defines a new hierarchy of complexity classes “just above <italic>NP</italic””, introducing Arthur vs. Merlin games and proving that it consists precisely of those languages which belong to NP. Expand
Checking computations in polylogarithmic time
TLDR
WJe show that every nondeterministic computational task S(Z, y), defined as a polynomial time relation between the instance x, representing the input and output combined, and the witness y can be modified to a task S such that each instance/witness pair becomes checkable in poly!ogariihmic Monte Carlo time. Expand
Canonical labeling of graphs
TLDR
An algebraic approach to the problem of assigning canonical forms to graphs by computing canonical forms and the associated canonical labelings in polynomial time is announced. Expand
Complexity classes in communication complexity theory
TLDR
The main objective is to exploit the analogy between Turing machine (TM) and communication complexity (CC) classes to provide a more amicable environment for the study of questions analogous to the most notorious problems in TM complexity. Expand
Non-deterministic exponential time has two-prover interactive protocols
TLDR
It is shown that the class of languages having tow-prover interactive proof systems is nondeterministic exponential time and that to prove membership in languages inEXP, the honest provers need the power ofEXP only. Expand
Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs
TLDR
Lower bounds of the form Ω(n · c−k), for the number of bits that need to be exchanged in order to compute some (explicitly given) polynomial time computable functions are proved. Expand
Spectra of Cayley graphs
  • L. Babai
  • Mathematics, Computer Science
  • J. Comb. Theory, Ser. B
  • 1 October 1979
TLDR
The results are formulated for directed graphs with colored edges and the existence of k nonisomorphic Cayley graphs of Dp with the same spectrum provided p > 64k, prime is proved. Expand
...
1
2
3
4
5
...