Pages that link to "Item:Q4302285"
From MaRDI portal
The following pages link to Linear Time Algorithms and NP-Complete Problems (Q4302285):
Displayed 9 items.
- Graph properties checkable in linear time in the number of vertices (Q596315) (← links)
- On the expressive power of monadic least fixed point logic (Q817849) (← links)
- Sorting, linear time and the satisfiability problem (Q1817067) (← 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)
- A NORMAL FORM FOR FIRST-ORDER LOGIC OVER DOUBLY-LINKED DATA STRUCTURES (Q3532152) (← links)
- Algebraic and logical characterizations of deterministic linear time classes (Q5048946) (← links)
- Quadratic Time-Space Lower Bounds for Computing Natural Functions with a Random Oracle (Q5090435) (← links)