Pages that link to "Item:Q4806606"
From MaRDI portal
The following pages link to Worst-case time bounds for coloring and satisfiability problems (Q4806606):
Displaying 6 items.
- Exact algorithms for exact satisfiability and number of perfect matchings (Q958212) (← links)
- Complexity analysis of a decentralised graph colouring algorithm (Q963399) (← links)
- Which problems have strongly exponential complexity? (Q1604206) (← links)
- Locally consistent constraint satisfaction problems (Q2581264) (← links)
- The Time Complexity of Constraint Satisfaction (Q3503589) (← links)
- Faster graph coloring in polynomial space (Q5925619) (← links)
