Open Research Index

Critical recovery, query lower bounds and binary-native width

Idris Ali Shaik

Palomar Registrypalomar/PALOMAR-2026-10-22-000011Oct 22, 2026cs.CCscore 0

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.

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-22-000011
curl -X POST /api/v1/records/palomar/PALOMAR-2026-10-22-000011/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-22-000011/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'