Pages that link to "Item:Q3896845"
From MaRDI portal
The following pages link to On self-transformable combinatorial problems (Q3896845):
Displaying 5 items.
- On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P (Q845727) (← links)
- Constructive complexity (Q1182305) (← links)
- On some bandwidth restricted versions of the satisfiability problem of propositional CNF formulas (Q1262855) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- Strong Backdoors for Default Logic (Q2818000) (← links)
