Pages that link to "Item:Q5751941"
From MaRDI portal
The following pages link to Power indices and easier hard problems (Q5751941):
Displaying 8 items.
- Refining complexity analyses in planning by exploiting the exponential time hypothesis (Q504223) (← 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)
- Which problems have strongly exponential complexity? (Q1604206) (← links)
- Sorting, linear time and the satisfiability problem (Q1817067) (← links)
- New methods for 3-SAT decision and worst-case analysis (Q1960406) (← links)
- Predecessor existence problems for finite discrete dynamical systems (Q2455591) (← links)
- Complement, Complexity, and Symmetric Representation (Q2949722) (← links)
