Pages that link to "Item:Q2235760"
From MaRDI portal
The following pages link to The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems (Q2235760):
Displaying 3 items.
- Refining complexity analyses in planning by exploiting the exponential time hypothesis (Q504223) (← links)
- General lower bounds and improved algorithms for infinite-domain CSPs (Q2700386) (← links)
- Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis (Q2922627) (← links)
