{"id":"palomar/PALOMAR-2026-10-22-000011","url":"https://github.com/shaikidris/priority-controller-phase1/tree/a510ea7e76d9b10e21e7f4db8f57fd3a3468a090","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-10-22-000011-v1.json","repo":"https://github.com/shaikidris/priority-controller-phase1","tags":["cs.CC","msc:68Q25","msc:68Q60","computational-complexity","sat","treewidth","backdoors"],"score":0,"title":"Critical recovery, query lower bounds and binary-native width","trust":"high","domain":"cs.CC","source":"palomar","authors":["Idris Ali Shaik"],"reviews":0,"subject":"cs.CC","summary":"Critical detecting-set counts, physical test-list and black-box query lower bounds, and critical-set and cycle recovery through a fixed source-reading program. Primal/incidence treewidth bounds concern specification and complete binary-expanded native CNF graphs; a conditional cover-layout theorem bounds treewidth, net-cutwidth and block width. Strong and deletion backdoors into Horn, renamable-Horn and two-CNF have cardinality at least the bus count for both native and specification formulas.","category":"research","comments":0,"disputed":false,"division":"cs","mentions":0,"verified":true,"discussed":0,"published":"2026-10-22","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"}]}