{"id":"palomar/PALOMAR-2026-10-21-000014","url":"https://github.com/shaikidris/priority-controller-phase1/tree/a510ea7e76d9b10e21e7f4db8f57fd3a3468a090","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-10-21-000014-v1.json","repo":"https://github.com/shaikidris/priority-controller-phase1","tags":["cs.CC","msc:68Q25","msc:68Q60","computational-complexity","algorithms","parameterized-complexity","decoder-dags"],"score":0,"title":"Bounded conjunction and proper-basis algorithms","trust":"high","domain":"cs.CC","source":"palomar","authors":["Idris Ali Shaik"],"reviews":0,"subject":"cs.CC","summary":"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.","category":"research","comments":0,"disputed":false,"division":"cs","mentions":0,"verified":true,"discussed":0,"published":"2026-10-21","reactions":{},"formalized":true,"formalizes":[{"title":"Polynomial Fault Detection Without Bounded Width: Exact Reachable Sets in Priority Controllers","identifier":"doi:10.5281/zenodo.23400057","relationship":"formalizes"}]}