Computability / CONCEPT
Polynomial pairing from one common input
Polynomial pairing from one common input.
Closed
DIRECT PREREQUISITES4
DIRECT CONSEQUENCES3
PROOF DEPTH8
DOCUMENT LINKS0
simulationRegister_injective
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
- An executed ordered pair constructorstructural-affinity · Closed
- Both tape decisions in a stack framestructural-affinity · Closed
- Composition of polynomial many-one reductionsstructural-affinity · Closed
- Executed polynomial transducer compositionstructural-affinity · Closed
- Original guarded UNSAT and the ordered UNSAT-SAT pairstructural-affinity · Closed
- Original native binary tablestructural-affinity · Closed
- Original native binary word acquisitionstructural-affinity · Closed
- Polynomial preprocessing before a total verifierstructural-affinity · Closed
- Preserving witnesses under polynomial instance mapsstructural-affinity · Closed
- Register injection and disjoint framesstructural-affinity · Closed
- Total exact binary pair projectionsstructural-affinity · Closed
- Total normalization of bounded verifiersstructural-affinity · Closed
- Whole stack programs as polynomial tape machinesstructural-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