Pages that link to "Item:Q5902002"
From MaRDI portal
The following pages link to SOFSEM 2004: Theory and Practice of Computer Science (Q5902002):
Displaying 4 items.
- An algebraic hardness criterion for surjective constraint satisfaction. (Q485113) (← links)
- From backdoor key to backdoor completability: improving a known measure of hardness for the satisfiable CSP (Q1626727) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- Methods and Applications of Artificial Intelligence (Q5307313) (← links)