Pages that link to "Item:Q1817067"
From MaRDI portal
The following pages link to Sorting, linear time and the satisfiability problem (Q1817067):
Displaying 11 items.
- On unique graph 3-colorability and parsimonious reductions in the plane (Q596079) (← links)
- Graph properties checkable in linear time in the number of vertices (Q596315) (← links)
- The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness (Q673091) (← links)
- Enumeration complexity of conjunctive queries with functional dependencies (Q778529) (← links)
- On the expressive power of monadic least fixed point logic (Q817849) (← links)
- A descriptive complexity approach to the linear hierarchy. (Q1401413) (← links)
- Exact complexity of problems of incompletely specified automata (Q1817068) (← links)
- Nonerasing, counting, and majority over the linear time hierarchy (Q1854524) (← links)
- Linear time and the power of one first-order universal quantifier (Q1854556) (← links)
- (Q3305356) (← links)
- Algebraic and logical characterizations of deterministic linear time classes (Q5048946) (← links)
