P-Complete Problems Overview

• P-complete problems are decision problems in P that are among the hardest under logspace reductions.
• Restricted circuit models like the synchronous monotone and sequential NOR circuits encode full polynomial-time computation in constrained formats.
• Game-theoretic frameworks and compact automata constructions illustrate practical simulations and the limits of algorithmic reductions in P-completeness.

In computational complexity, P-complete denotes a decision problem that lies in $\mathbf{P}$ and is complete for $\mathbf{P}$ under logspace reductions. Equivalently, it is among the hardest problems in $\mathbf{P}$ under that reduction notion: membership in $\mathbf{P}$ is accompanied by the property that every language in $\mathbf{P}$ reduces to it in logarithmic space. In the literature considered here, P-completeness is exhibited by restricted circuit evaluation problems, by graph games such as cat-and-mouse, and by oracle constructions based on a $\mathbf{P}$-complete language $D_{NP}$ (Huq, 2015, 0906.3208, Chavrimootoo et al., 2023).

1. Formal meaning and representative problems

A language is P-complete if it satisfies two conditions: it is in $\mathbf{P}$, and every language in $\mathbf{P}$ is reducible to it by a logspace reduction. The supplied papers use that formulation explicitly for cat-and-mouse and implicitly for restricted circuit-value problems that serve as reduction sources (Huq, 2015).

The following problems appear as central representatives.

Problem	Setting	Result
Synchronous Monotone Circuit Value Problem	monotone synchronous circuits	P-complete
Sequential NOR Circuit Value Problem	sequential NOR circuits	P-complete
Directed-Happy-Cat / Undirected-Happy-Cat	graph game on directed or undirected graphs	P-complete
$D_{NP}$	oracle language used as a $\mathbf{P}$0-complete set	$\mathbf{P}$1-complete

The common pattern is that P-complete problems encode full polynomial-time computation inside very constrained combinatorial or automata-theoretic formats. In the cited work, circuit evaluation is the dominant source problem, and the reductions preserve enough structure to support secondary objectives such as small-state automata constructions or game-theoretic simulations (0906.3208, Huq, 2015).

2. Restricted circuit evaluation as a source of P-completeness

One of the most useful P-complete sources in this literature is the Synchronous Monotone Circuit Value Problem. The reduction framework assumes a circuit that is monotone, has only AND and OR gates, is synchronous in the sense that every path from an input to the output has the same length, and can be taken with fan-in and fan-out $\mathbf{P}$2. This problem is used as the source for the cat-and-mouse hardness proof (Huq, 2015).

A second source problem is the Sequential NOR Circuit Value Problem. A sequential NOR circuit has a single source vertex fixed to value $\mathbf{P}$3, a single gate type $\mathbf{P}$4, and the sequential restriction that the $\mathbf{P}$5-th gate takes as first input the immediately previous gate $\mathbf{P}$6, while the second input is some earlier gate $\mathbf{P}$7 with $\mathbf{P}$8. Its normal form is

$\mathbf{P}$9

The cited paper treats this problem as P-complete and explains its expressive sufficiency by short NOR gadgets for negation and conjunction (0906.3208).

These restricted circuit models matter because they isolate the computational core of P-completeness while suppressing irrelevant syntactic freedom. In the monotone synchronous case, the layered structure supports gadget-by-gadget simulation in games. In the sequential NOR case, the recursive dependence on earlier gates supports compact encodings and highly economical automata (Huq, 2015, 0906.3208).

3. Game-theoretic P-completeness: cat-and-mouse

The paper on cat-and-mouse defines the language

$\mathbf{P}$0

with directed and undirected variants depending on whether $\mathbf{P}$1 is directed or undirected. Cat starts at $\mathbf{P}$2, Mouse starts at $\mathbf{P}$3, and Hole is $\mathbf{P}$4. Cat wins by occupying the same node as Mouse; Mouse wins by reaching the Hole before capture; a repeated position with the same player to move is a draw. The paper proves both Directed-Happy-Cat and Undirected-Happy-Cat are P-complete (Huq, 2015).

The hardness proof is a logspace reduction from SMCVP. The construction duplicates the circuit into a Mouse subgraph $\mathbf{P}$5 and a Cat subgraph $\mathbf{P}$6. Mouse starts at the output node of $\mathbf{P}$7, Cat starts at the output node of $\mathbf{P}$8, and the intended semantics are: $\mathbf{P}$9 The reduction is arranged so that Mouse wins exactly when the circuit evaluates to true, while Cat wins exactly when it evaluates to false (Huq, 2015).

Several gadgets enforce this correspondence. OR-gate behavior is implemented by allowing Mouse to choose between branches. AND-gate behavior is enforced with threat edges, which allow Cat to block one branch so that Mouse can proceed safely only when both inputs are true. Escape routes force Cat to mirror Mouse: if Cat deviates from the mirrored path, Mouse can reach the Hole through a protected bypass. In the undirected case, guard edges prevent Mouse from exploiting backtracking created by edge symmetrization. The result is a direct game-theoretic realization of circuit evaluation, establishing that the undirected game is not easier than the directed one from the standpoint of logspace hardness (Huq, 2015).

4. Succinct automata and language-theoretic representations

The sequential NOR source problem is also used to produce a very compact automata-theoretic representation of a P-complete language. The cited paper introduces a new binary encoding of sequential NOR circuits over the alphabet $\mathbf{P}$0, writes the circuit in reverse order, and appends a suffix $\mathbf{P}$1 that serves as workspace. For a circuit

$\mathbf{P}$2

the encoding represents $\mathbf{P}$3 by $\mathbf{P}$4, $\mathbf{P}$5 by $\mathbf{P}$6, and each $\mathbf{P}$7 for $\mathbf{P}$8 by $\mathbf{P}$9, yielding words of the form

$\mathbf{P}$0

This encoding is tailored to diagonal propagation in a trellis automaton (0906.3208).

A trellis automaton is defined as a quintuple

$\mathbf{P}$1

with initial map $\mathbf{P}$2, local transition function $\mathbf{P}$3, and recursive evaluation

$\mathbf{P}$4

The paper constructs a trellis automaton with 11 states over the 2-letter alphabet $\mathbf{P}$5, with accepting set $\mathbf{P}$6. The transition system is organized so that each $\mathbf{P}$7 in the suffix $\mathbf{P}$8 spawns a diagonal carrying the value of one gate, and the automaton uses decorated variants of $\mathbf{P}$9 and $\mathbf{P}$0 together with a question-mark state to fetch referenced gate values and compute the next NOR value. After eliminating impossible cases, the construction uses 50 useful transitions (0906.3208).

This result shows that a P-complete language can be recognized by an extremely small one-way real-time cellular model. The same construction yields, via the equivalence between trellis automata and linear conjunctive grammars, a linear conjunctive grammar with 11 nonterminals and at most 200 rules for a P-complete language (0906.3208).

5. P-complete oracles and relativization

A different role for P-completeness appears in the analysis of oracle constructions. For any $\mathbf{P}$1-complete oracle $\mathbf{P}$2, the critique paper recalls the standard fact

$\mathbf{P}$3

hence

$\mathbf{P}$4

A claimed separation relative to a $\mathbf{P}$5-complete oracle is therefore as strong as an unconditional separation of $\mathbf{P}$6 and $\mathbf{P}$7 (Chavrimootoo et al., 2023).

The oracle set under discussion is $\mathbf{P}$8, paired with the deterministic version $\mathbf{P}$9: $D_{NP}$0

$D_{NP}$1

The paper identifies $D_{NP}$2 as a recursively enumerable and in fact $D_{NP}$3-complete language. Its central corrective claim is Proposition 3: $D_{NP}$4 Because $D_{NP}$5 many-one reduces to $D_{NP}$6, one oracle query suffices to decide $D_{NP}$7 relative to $D_{NP}$8. This refutes the criticized claim that the relevant computation requires $D_{NP}$9 oracle queries (Chavrimootoo et al., 2023).

The methodological point is precise. A lower bound on the number of oracle queries is not the same thing as a lower bound on the base computation time of the oracle Turing machine. The critique argues that the invalid proof conflates these two notions; the one-query reduction already rules out the asserted exponential query bound (Chavrimootoo et al., 2023).

6. Terminological scope and unrelated uses of “complete” with $\mathbf{P}$0

The expression “complete” combined with a parameter $\mathbf{P}$1 also occurs in mathematically unrelated ways. The complete vertex $\mathbf{P}$2-center problem denotes solving the vertex $\mathbf{P}$3-center problem for every $\mathbf{P}$4, producing the full trade-off curve

$\mathbf{P}$5

rather than a single fixed-$\mathbf{P}$6 solution (Medrano, 2021). A different usage appears in $\mathbf{P}$7-complete square-free word-representability, where a word $\mathbf{P}$8 is called $\mathbf{P}$9-complete square-free if there does not exist any subset $\mathbf{P}$0 such that the restricted word $\mathbf{P}$1 contains a square $\mathbf{P}$2 with $\mathbf{P}$3, and a graph is $\mathbf{P}$4-complete square-free word-representable if it admits such a word-representant (Das et al., 8 May 2025).

This suggests a genuine terminological ambiguity: “P-complete” in complexity theory refers to completeness for the class $\mathbf{P}$5 under logspace reductions, whereas “complete $\mathbf{P}$6-...” in other areas can refer instead to solving an optimization problem for all parameter values $\mathbf{P}$7 or to a parameterized structural prohibition indexed by $\mathbf{P}$8. The complexity-theoretic notion is the one tied to circuit evaluation, oracle closure, and reduction theory (Medrano, 2021, Das et al., 8 May 2025).

Overall, the literature considered here presents P-completeness as a structural benchmark for polynomial-time computation. Restricted circuits such as SMCVP and sequential NOR capture it in highly controlled algebraic forms; cat-and-mouse realizes it in perfect-information games; trellis automata show that even very small real-time devices can recognize P-complete languages; and oracle analyses show that $\mathbf{P}$9-complete sets are strong enough that relativized separations over them collapse to the unrelativized $D_{NP}$0 versus $D_{NP}$1 question (Huq, 2015, 0906.3208, Chavrimootoo et al., 2023).