Pages that link to "Item:Q3936214"
From MaRDI portal
The following pages link to Linear time transformations between combinatorial problems (Q3936214):
Displaying 11 items.
- Reducing the generalised Sudoku problem to the Hamiltonian cycle problem (Q504159) (← links)
- On unique graph 3-colorability and parsimonious reductions in the plane (Q596079) (← links)
- On quasilinear-time complexity theory (Q672330) (← links)
- The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness (Q673091) (← links)
- Permutation graphs: Connected domination and Steiner trees (Q1174135) (← links)
- The complexity types of computable sets (Q1190982) (← links)
- On minimum intersection of two minimum dominating sets of interval graphs (Q1377653) (← links)
- Sorting, linear time and the satisfiability problem (Q1817067) (← links)
- Exact complexity of problems of incompletely specified automata (Q1817068) (← links)
- Power indices and easier hard problems (Q5751941) (← links)
- Proper colorability of segment intersection graphs (Q6571282) (← links)