Arith / CONCEPT
The affine valuation identification lower bound
Exact adaptive identification by affine prime-power valuation queries requires at least d e (p-1) observations on one fixed input.
Closed
DIRECT PREREQUISITES3
DIRECT CONSEQUENCES1
PROOF DEPTH8
DOCUMENT LINKS1
One actual complete-response history attains the lower bound
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
- Affine words and typed local quotient coordinatesstructural-affinity · Closed
- Chronological Child Prefixes for Residue Protocolsstructural-affinity · Closed
- Effective common-direction digit schedulingstructural-affinity · Closed
- Effective short positive probesstructural-affinity · Closed
- Exact acquisition by positive replacement and graft wordsstructural-affinity · Closed
- Exact Residue Fibers and Adaptive Posteriorsstructural-affinity · Closed
- Global affine behavior and joint local realizationstructural-affinity · Closed
- One chronological acquisition trajectorystructural-affinity · Closed
- Passive Policy Normalizationstructural-affinity · Closed
- Preserving a continuous competitor's acquired informationstructural-affinity · Closed
- Prime-power Nonadaptive Resolutionstructural-affinity · Closed
- Returned arithmetic behavior and serial continued usestructural-affinity · Closed
- Terminal Histories and Exact First-Step Costsstructural-affinity · Closed
- Uniform Height Bound for Residue Identificationstructural-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