Computability / CONCEPT
Total normalization of bounded verifiers
Total normalization of bounded verifiers.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES1
PROOF DEPTH10
DOCUMENT LINKS0
normalize
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- A total primitive witness-length comparisonstructural-affinity · Closed
- Both tape decisions in a stack framestructural-affinity · Closed
- Checking the original target certificate boundstructural-affinity · Closed
- Executed unary polynomial budgetsstructural-affinity · Closed
- NP preimages with exact target witness boundsstructural-affinity · Closed
- Original guarded UNSAT and the ordered UNSAT-SAT pairstructural-affinity · Closed
- Polynomial pairing from one common inputstructural-affinity · Closed
- Polynomial preprocessing before a total verifierstructural-affinity · Closed
- Preserving witnesses under polynomial instance mapsstructural-affinity · Closed
- The ordered original guarded pair languagestructural-affinity · Closed
- Total exact binary pair projectionsstructural-affinity · Closed
Documents & exposition
None recorded in this release.
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance