Authors define Q-MICE as a sound #QBF proof system extending MICE ideas, prove upper bounds including on quantified XOR-PAIRS, and separate it from expansion-based systems.
Logic, Automata, and Computational Complexity: The Works of Stephen A
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On Proof Systems for #QBF
Authors define Q-MICE as a sound #QBF proof system extending MICE ideas, prove upper bounds including on quantified XOR-PAIRS, and separate it from expansion-based systems.