Observer / CONCEPT
Uniform Height Bound for Residue Identification
Every complete prime-power residue node admits an identifying passive protocol with at most (e-d)(p-1) queries on every target.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES2
PROOF DEPTH7
DOCUMENT LINKS1
An identifying tree with a uniform bound on realized traces
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
- Chronological Child Prefixes for Residue Protocolsstructural-affinity · Closed
- Effective short positive probesstructural-affinity · Closed
- Equality Query Schedule Normal Formstructural-affinity · Closed
- Exact acquisition by positive replacement and graft wordsstructural-affinity · Closed
- Exact Residue Fibers and Adaptive Posteriorsstructural-affinity · Closed
- One chronological acquisition trajectorystructural-affinity · Closed
- Preserving a continuous competitor's acquired informationstructural-affinity · Closed
- Prime-power Nonadaptive Resolutionstructural-affinity · Closed
- Terminal Histories and Exact First-Step Costsstructural-affinity · Closed
- The affine valuation identification lower boundstructural-affinity · Closed
- Weighted Identification of Sibling Residue Leavesstructural-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