Computability / CONCEPT
Composition of polynomial many-one reductions
Composition of polynomial many-one reductions.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH7
DOCUMENT LINKS0
PolyRed.trans
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
None recorded in this release.
RELATED KNOWLEDGE
Structural connections
- A finite lexical repair transducerstructural-affinity · Closed
- Both tape decisions in a stack framestructural-affinity · Closed
- Executed polynomial transducer compositionstructural-affinity · Closed
- Executed unary polynomial budgetsstructural-affinity · Closed
- Polynomial pairing from one common inputstructural-affinity · Closed
- Preserving witnesses under polynomial instance mapsstructural-affinity · Closed
- Tape execution inside finite stacksstructural-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