In computational complexity theory, a computational problem is complete for a complexity class if it is, in a technical sense, among the "hardestâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2000

Highly Cited

2000

- Roberto Giacobazzi, Francesco Ranzato, Francesca Scozzari
- J. ACM
- 2000

Completeness is an ideal, although uncommon, feature of abstract interpretations, formalizing the intuition that, relatively toâ€¦Â (More)

Is this relevant?

Highly Cited

1988

Highly Cited

1988

- Avrim Blum, Ronald L. Rivest
- COLT
- 1988

-We consider a 2-layer, 3-node, n-input neural network whose nodes compute linear threshold functions of their inputs. We showâ€¦Â (More)

Is this relevant?

Highly Cited

1988

Highly Cited

1988

- Michael J. Maher
- [1988] Proceedings. Third Annual Informationâ€¦
- 1988

Complete axiomizations for the algebras of infinite trees and infinite trees are presented. The axiomizations are parameterizedâ€¦Â (More)

Is this relevant?

Highly Cited

1987

Highly Cited

1987

- Oded Goldreich, Silvio Micali, Avi Wigderson
- STOC
- 1987

We present a polynomial-time algorithm that, given as a input the description of a game with <italic>incomplete information andâ€¦Â (More)

Is this relevant?

Highly Cited

1986

Highly Cited

1986

- Leonid A. Levin
- SIAM J. Comput.
- 1986

Many interesting combinatorial problems were found to be NP-complete. Since there is little hope to solve them fast in the worstâ€¦Â (More)

Is this relevant?

Highly Cited

1981

Highly Cited

1981

- Ian Holyer
- SIAM J. Comput.
- 1981

We show that it is NP-complete to determine the chromatic index of an arbitrary graph. The problem remains NP-complete even forâ€¦Â (More)

Is this relevant?

Highly Cited

1981

Highly Cited

1981

- David S. Johnson
- J. Algorithms
- 1981

This is the fourth edition of a quarterly column the purpose of which is to provide continuing coverage of new developments inâ€¦Â (More)

Is this relevant?

Highly Cited

1979

Highly Cited

1979

- Leslie G. Valiant
- STOC
- 1979

In the theory of recursive functions and computational complexity it has been demonstrated repeatedly that the natural problemsâ€¦Â (More)

Is this relevant?

Highly Cited

1974

Highly Cited

1974

- M. R. Garey, David S. Johnson, Larry J. Stockmeyer
- STOC
- 1974

It is widely believed that showing a problem to be NP-complete is tantamount to proving its computational intractability. In thisâ€¦Â (More)

Is this relevant?

Highly Cited

1973

Highly Cited

1973

- Ravi Sethi
- STOC
- 1973

The search for efficient algorithms for register allocation dates back to the time of the first Fortran compiler for the IBM 704â€¦Â (More)

Is this relevant?