Lax Lean Archive

Polynomial time for CNF verification

Lax429075.VerifierTime · concepts/Lax429075/VerifierTime.lean · lax-429075

proven

Loading review…

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Natural Language Statement

    Lemma

    A finite stack machine decodes the paired input and checks the supplied assignment. Its running time is polynomial in the input length, including on malformed encodings, using the machine model of lax-434930.

    Concept map
    6 concepts
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

    Each proof establishes this claim relative to its assumptions.

    In the paper

    • page 2 of this submission's paper

    Lean source view on GitHub

    1import Lax429075.Satisfiability
    2
    3/-!
    4---
    5title: Polynomial time for CNF verification
    6type: lemma
    7---
    8A finite stack machine decodes the paired input and checks the supplied
    9assignment. Its running time is polynomial in the input length, including
    10on malformed encodings, using the machine model of
    11[lax-434930](https://laxarchive.org/lax-434930/).
    12-/
    13
    14namespace Lax429075.VerifierTime
    15
    16open Satisfiability Lax434930.PolynomialTime
    17
    18axiom polynomial : Verifier ∈ P
    19
    20end Lax429075.VerifierTime
    21
    Show Proof
    Builds on
    Used by

    none

    From Mathlib

    none

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…