#### Filter Results:

- Full text PDF available (98)

#### Publication Year

1972

2017

- This year (1)
- Last 5 years (29)
- Last 10 years (46)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- László Babai, Lance Fortnow, Carsten Lund
- computational complexity
- 1990

We determine the exact power of two-prover interactive proof systems introduced by Ben-Or, Goldwasser, Kilian, and Wigderson (1988). In this system, two all-powerful noncommunicating provers convince a randomizing polynomial time verifier in polynomial time that the inputx belongs to the languageL. We show that the class of languages having tow-prover… (More)

- László Babai, Peter Frankl, Janos Simon
- 27th Annual Symposium on Foundations of Computer…
- 1986

We take a complexity theoretic view of A. C. Yao's theory of communication complexity. A rich structure of natural complexity classes is introduced. Besides providing a more structured approach to the complexity of a variety of concrete problems of interest to VLSI, the main objective is to exploit the analogy between Turing machine (TM) and communication… (More)

- László Babai
- Combinatorica
- 1986

- Noga Alon, László Babai, Alon Itai
- J. Algorithms
- 1986

A simple parallel randomized algorithm to find a maximal independent set in a graph G = (V, E) on n vertices is presented. Its expected rmming time on a concurrent-read concurrent-write PRAM with 0(1 E 1 d,,) processors is O(log n), where d,, denotes the maximum degree. On an exclusive-read exclusive-write PRAM with 0(1 El) processors the algorithm runs in… (More)

- László Babai, Lance Fortnow, Leonid A. Levin, Mario Szegedy
- STOC
- 1991

Motivated by Manuel Blum's concept of in-st ante checking, we consider new, very fast and generic mechanisms of checking computations. Our results exploit recent advances in interactive proof protocols [LFKN], [Sh], and especially the MIP = NEXP protocol from [BFL]. WJe show that every nondeterministic computational task S(Z, y), defined as a polynomial… (More)

- László Babai
- STOC
- 1985

In a previous paper [BS] we proved, using the elements of the theory of <italic>nilpotent groups</italic>, that some of the <italic>fundamental computational problems in matriz groups</italic> belong to <italic>NP</italic>. These problems were also shown to belong to <italic>coNP</italic>, assuming an <italic>unproven hypothesis</italic> concerning… (More)

- László Babai, Eugene M. Luks
- STOC
- 1983

We announce an algebraic approach to the problem of assigning <italic>canonical forms</italic> to graphs. We compute canonical forms and the associated canonical labelings (or renumberings) in polynomial time for graphs of bounded valence, in moderately exponential, exp(n<supscrpt>½ + &ogr;(1)</supscrpt>),time for general graphs, in subexponential,… (More)

- László Babai, Noam Nisan
- computational complexity
- 1991

We show thatBPP can be simulated in subexponential time for infinitely many input lengths unless exponential time ℴ collapses to the second level of the polynomial-time hierarchy. ℴ has polynomial-size circuits and ℴ has publishable proofs (EXPTIME=MA). ℴ collapses to the second level of the polynomial-time hierarchy. ℴ has polynomial-size circuits and ℴ… (More)

- László Babai, Noam Nisan, Mario Szegedy
- J. Comput. Syst. Sci.
- 1992

Let f (xl,. .. . xk) be a Boolean function that k parties wish to collaboratively evaluate, where each xi is a bit-string of length n. The ith party knows each input argument except x,; and each party has unlimited computational power. They share a blackboard, viewed by all parties, where they can exchange messages. The objective is to minimize the number… (More)

- László Babai
- Journal of Graph Theory
- 1991