Pages that link to "Item:Q4749821"
From MaRDI portal
The following pages link to A lower bound for the complexity of Craig's interpolants in sentential logic (Q4749821):
Displayed 6 items.
- Tautologies with a unique Craig interpolant, uniform vs. nonuniform complexity (Q1076669) (← links)
- Some consequences of cryptographical conjectures for \(S_2^1\) and EF (Q1383164) (← links)
- No feasible monotone interpolation for simple combinatorial reasoning (Q1575265) (← links)
- Natural limitations of decision procedures for arithmetic with bounded quantifiers (Q3674633) (← links)
- Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic (Q4358049) (← links)
- The Complexity of Propositional Proofs (Q5444711) (← links)