P-complete

Known as: CVP, PTIME-hard, Circuit value problem 
In complexity theory, a decision problem is P-complete (complete for the complexity class P) if it is in P and every problem in P can be reduced to… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2006
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)
  • table 1.1
  • table 1.2
  • table 2.1
  • table 3.1
  • table 3.2
Is this relevant?
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)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1994
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
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
We show that the problem of counting the number of linear extensions of a given partially ordered set is #P-complete. This… (More)
  • figure 2
  • figure 1
Is this relevant?
Highly Cited
1990
Highly Cited
1990
This paper concerns the complexity analysis of the roommate problem and intern assignment problem with couples. These are two… (More)
  • figure 2.7
  • figure 3.3
Is this relevant?
Highly Cited
1990
Highly Cited
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
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
For P-complete problems such as traveling salesperson, cycle covers, 0-1 integer programming, multicommodity network flows… (More)
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1975
Highly Cited
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)
  • figure 1
Is this relevant?