Pages that link to "Item:Q1098635"

The following pages link to Nonconstructive advances in polynomial-time complexity (Q1098635):

Displaying 22 items.

• A decidability result for the dominating set problem (Q410736) (← links)
• 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)
• A brief history of Edward K. Blum and the Journal of Computer and System Sciences (Q1745715) (← links)
• Connections between cutting-pattern sequencing, VLSI design, and flexible machines (Q1941954) (← links)
• From the \(W\)-hierarchy to XNLP. Classes of fixed parameter intractability (Q2154075) (← links)
• Fixed-Parameter Tractability, A Prehistory, (Q2908528) (← links)
• The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
• The Impact of Parameterized Complexity to Interdisciplinary Problem Solving (Q2908532) (← links)
• A Basic Parameterized Complexity Primer (Q2908536) (← links)
• Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
• Surfing with Rod (Q2973715) (← links)
• Polynomial-time self-reducibility: theoretical motivations and practical results^∗ (Q4009694) (← links)
• LP Formulations for Polynomial Optimization Problems (Q4637509) (← links)
• A multiple-population evolutionary approach to gate matrix layout (Q4653445) (← links)