Pages that link to "Item:Q4305345"
From MaRDI portal
The following pages link to Logical Description of Monotone NP Problems (Q4305345):
Displaying 8 items.
- Graph properties checkable in linear time in the number of vertices (Q596315) (← links)
- Complete problems for monotone NP (Q673092) (← links)
- Positive versions of polynomial time (Q1281503) (← links)
- Context-sensitive transitive closure operators (Q1319508) (← links)
- Program schemes, arrays, Lindström quantifiers and zero-one laws (Q1606129) (← links)
- The price of query rewriting in ontology-based data access (Q2453744) (← links)
- Using Program Schemes to Capture Polynomial-Time Logically on Certain Classes of Structures (Q4827608) (← links)
- Positive First-order Logic on Words and Graphs (Q6135776) (← links)