ObserverMemory / CONCEPT
Controlled Pair-Edge Complexity
Explicit controlled pair-edge construction has input-linear quadratic resource bounds.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH3
DOCUMENT LINKS1
Explicit controlled pair edges have quadratic state complexity
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
- Canonical Discounted Future Geometrystructural-affinity · Closed
- Completion Kernel Greatest Fixed Pointstructural-affinity · Closed
- Finite Future Congruencestructural-affinity · Closed
- Knaster–Tarski Witnessstructural-affinity · Closed
- Maximal Forward-Invariant Subkernelstructural-affinity · Closed
- Recursive Definitions as Selected Fixed Pointsstructural-affinity · Closed
- Reverse Search for First Separationstructural-affinity · Closed
- Three-Cycle Fixed-Point Gapstructural-affinity · Closed
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance