The following pages link to (Q3220555):
Displaying 8 items.
- Simple sentences that are hard to decide (Q810009) (← links)
- A uniform method for proving lower bounds on the computational complexity of logical theories (Q917543) (← links)
- Why Horn formulas matter in computer science: initial structures and generic examples (Q1089797) (← links)
- Subclasses of Presburger arithmetic and the polynomial-time hierarchy (Q1115858) (← links)
- Dominoes and the complexity of subclasses of logical theories (Q1115859) (← links)
- Descriptive characterizations of computational complexity (Q1123616) (← links)
- (Q3815280) (← links)
- Decision procedures using model building techniques (Q6560165) (← links)