arXiv (All)
open access
Parity Tests under Ties: A One-Test Lifting Theorem
In the unrestricted polynomial decision-tree model, only the number of polynomial sign tests is charged. A parity test asks for the sign of a product of pairwise differences. Such tests underlie low-depth randomized algorithms for maximum finding and top-$k$ selection, but their usual analysis assum
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Sparse Oblique Rule Boosting for Simpler Additive Rule Ensembles#974004
- TreeThink: A Modular Tree Search Library for Mathematical Reasoning with LLMs#986889
- Minimum-makespan completion and vertex selection leave the Wang-Sitters constant at 11/6#996802
- Table 3. Application of the decision tree to the modular assignments of the SE and PED degree courses#20922
- Table 3. Application of the decision tree to the modular assignments of the SE and PED degree courses#20921
Record · ID 1117130
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive