Pages that link to "Item:Q2875151"

The following pages link to Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses (Q2875151):

Displaying 24 items.

• Strong partial clones and the time complexity of SAT problems (Q340559) (← links)
• Kernelization using structural parameters on sparse graph classes (Q340583) (← links)
• Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
• A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments (Q385516) (← links)
• Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050) (← links)
• Kernel bounds for path and cycle problems (Q392032) (← links)
• Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing (Q392033) (← links)
• Data reduction for graph coloring problems (Q393081) (← links)
• Kernelization for cycle transversal problems (Q423937) (← links)
• Lower bounds on kernelization (Q456702) (← links)
• Confronting intractability via parameters (Q465686) (← links)
• Exploiting a hypergraph model for finding Golomb rulers (Q471187) (← links)
• Towards optimal and expressive kernelization for \(d\)-hitting set (Q486984) (← links)
• Improved deterministic algorithms for weighted matching and packing problems (Q534565) (← links)
• On the small cycle transversal of planar graphs (Q551170) (← links)
• Kernel bounds for disjoint cycles and disjoint paths (Q638521) (← links)
• Kernels for feedback arc set in tournaments (Q657916) (← links)
• A generalization of Nemhauser and Trotter's local optimization theorem (Q657921) (← links)
• Kernelization hardness of connectivity problems in \(d\)-degenerate graphs (Q713308) (← links)
• Fréchet distance between a line and avatar point set (Q722543) (← links)
• An improved kernelization algorithm for \(r\)-set packing (Q765496) (← links)
• An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion (Q1759683) (← links)
• A kernel of order \(2k-c\log k\) for vertex cover (Q1944208) (← links)
• Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)