Pages that link to "Item:Q2716514"
From MaRDI portal
The following pages link to On the complexity of certain completion problems (Q2716514):
Displaying 10 items.
- A series of algorithmic results related to the iterated hairpin completion (Q606982) (← links)
- A finite set of functions with an EXPTIME-complete composition problem (Q955009) (← links)
- On some algorithmic problems regarding the hairpin completion (Q1026117) (← links)
- Shellings from relative shellings, with an application to NP-completeness (Q2046454) (← links)
- The Complexity of the<i>A B C</i>Problem (Q4507329) (← links)
- System Completion Problem: Theory and Applications (Q4625781) (← links)
- Computing and Combinatorics (Q5716924) (← links)
- On Some $\mathcal{NP}$ -complete SEFE Problems (Q5746258) (← links)
- (Q5863474) (← links)
- Exploring the complexity boundary between coloring and list-coloring (Q5896984) (← links)