The following pages link to (Q4281695):
Displayed 3 items.
- 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)
- Sorting, linear time and the satisfiability problem (Q1817067) (← links)