Open Research Index

Bounded conjunction and proper-basis algorithms

Idris Ali Shaik

Palomar Registrypalomar/PALOMAR-2026-10-21-000014Oct 21, 2026cs.CCscore 0

Bounded-support and consistent selector-expansion laws for decoder DAGs, with complete native detection executions and checked emitted witnesses for bounded live conjunctions and proper bases. Selected time inequalities give a general XP bound, a polynomial bound for one live conjunction, and an FPT bound for healthy-one roots. Concrete source construction, total time and temporary word-storage proofs are supplied as companion declarations.

SourceRepositoryJSON

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-10-21-000014
curl -X POST /api/v1/records/palomar/PALOMAR-2026-10-21-000014/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-10-21-000014/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'