The following pages link to (Q3221973):
Displaying 11 items.
- Complete problems for monotone NP (Q673092) (← links)
- Methods for proving completeness via logical reductions (Q685391) (← links)
- On the power of deep pushdown stacks (Q1037618) (← links)
- A restricted second order logic for finite structures (Q1271559) (← links)
- A constant-space sequential model of computation for first-order logic (Q1271562) (← links)
- Succinct representation, leaf languages, and projection reductions (Q1271623) (← links)
- Program schemes, arrays, Lindström quantifiers and zero-one laws (Q1606129) (← links)
- On digraph coloring problems and treewidth duality (Q2427534) (← links)
- Parameterized Complexity Classes under Logical Reductions (Q3182930) (← links)
- Program Schemes with Deep Pushdown Storage (Q3507414) (← links)
- Independence-friendly logic without Henkin quantification (Q5918342) (← links)
