# P-complete

## Papers overview

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

2006

2006

- ICALP
- 2006

We show that the problem of predicting t steps of the 1D cellular automaton Rule 110 is P-complete. The result is found byâ€¦Â (More)

Is this relevant?

1996

1996

- 1996

We study cellular automata where the state at each site is decided by a majority vote of the sites in its neighborhood. These areâ€¦Â (More)

Is this relevant?

1994

1994

- computational complexity
- 1994

A serious limitation of the theory of P-completeness is that it fails to distinguish between those P-complete problems that doâ€¦Â (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- Theor. Comput. Sci.
- 1993

Circumscription and the closed-world assumption with its variants are well-known nonmonotonic techniques for reasoning withâ€¦Â (More)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- STOC
- 1991

We show that the problem of counting the number of linear extensions of a given partially ordered set is #P-complete. Thisâ€¦Â (More)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- J. Algorithms
- 1990

This paper concerns the complexity analysis of the roommate problem and intern assignment problem with couples. These are twoâ€¦Â (More)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- Artif. Intell.
- 1990

We consider the complexity of combining bodies of evidence according to the rules of the Dempster{Shafer theory of evidence. Weâ€¦Â (More)

Is this relevant?

Highly Cited

1977

Highly Cited

1977

- SIGA
- 1977

Ladner [3] ]has shown that the circuit value problem (CV) is log space complete for P, adding to the list of such problems foundâ€¦Â (More)

Is this relevant?

Highly Cited

1976

Highly Cited

1976

- J. ACM
- 1976

For P-complete problems such as traveling salesperson, cycle covers, 0-1 integer programming, multicommodity network flowsâ€¦Â (More)

Is this relevant?

Highly Cited

1975

Highly Cited

1975

- SIGA
- 1975

Cook [1], Jones and Laaser [4] have discovered several interesting problem s that are log space complete for P. We add another toâ€¦Â (More)

Is this relevant?