Pages that link to "Item:Q1098635"
From MaRDI portal
The following pages link to Nonconstructive advances in polynomial-time complexity (Q1098635):
Displayed 11 items.
- The complexity of querying indefinite data about linearly ordered domains (Q676427) (← links)
- Linear-time algorithms for problems on planar graphs with fixed disk dimension (Q845887) (← links)
- On problems without polynomial kernels (Q1034099) (← links)
- Constructive complexity (Q1182305) (← links)
- The vertex separation number of a graph equals its path-width (Q1198094) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- Improved self-reduction algorithms for graphs with bounded treewidth (Q1336622) (← links)
- Obstruction set isolation for the gate matrix layout problem (Q1336625) (← links)
- On search, decision, and the efficiency of polynomial-time algorithms (Q1342869) (← links)
- Polynomial-time self-reducibility: theoretical motivations and practical results<sup>∗</sup> (Q4009694) (← links)
- A multiple-population evolutionary approach to gate matrix layout (Q4653445) (← links)