Pages that link to "Item:Q3358723"
From MaRDI portal
The following pages link to Comparing the Expressibility of Languages Formed Using NP-Complete Operators (Q3358723):
Displaying 5 items.
- Generalized hex and logical characterizations of polynomial space (Q287159) (← links)
- Complete problems for monotone NP (Q673092) (← links)
- Methods for proving completeness via logical reductions (Q685391) (← links)
- Circumscribing DATALOG: expressive power and complexity (Q1127538) (← links)
- Context-sensitive transitive closure operators (Q1319508) (← links)
