Pages that link to "Item:Q619903"

The following pages link to Infeasibility of instance compression and succinct PCPs for NP (Q619903):

Displaying 30 items.

• On polynomial kernels for sparse integer linear programs (Q269481) (← links)
• Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
• Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (Q301524) (← links)
• Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (Q329279) (← links)
• Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
• Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050) (← links)
• Incremental list coloring of graphs, parameterized by conservation (Q391091) (← links)
• Kernel bounds for path and cycle problems (Q392032) (← links)
• Parameterized complexity of vertex deletion into perfect graph classes (Q392038) (← links)
• Data reduction for graph coloring problems (Q393081) (← links)
• On the parameterized complexity of the repetition free longest common subsequence problem (Q413298) (← links)
• Confronting intractability via parameters (Q465686) (← links)
• The kernelization complexity of connected domination in graphs with (no) small cycles (Q476436) (← links)
• On cutwidth parameterized by vertex cover (Q476444) (← links)
• Restricted and swap common superstring: a multivariate algorithmic perspective (Q494787) (← links)
• On the parameterized complexity of finding separators with non-hereditary properties (Q494799) (← links)
• Fixed-parameter algorithms for DAG partitioning (Q507587) (← links)
• On making a distinguished vertex of minimum degree by vertex deletion (Q528861) (← links)
• Kernel bounds for disjoint cycles and disjoint paths (Q638521) (← links)
• Kernelization hardness of connectivity problems in \(d\)-degenerate graphs (Q713308) (← links)
• Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization (Q722549) (← links)
• Dual parameterization of weighted coloring (Q786042) (← links)
• Meta-kernelization with structural parameters (Q896025) (← links)
• Two edge modification problems without polynomial kernels (Q1662097) (← links)
• Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover} (Q1679222) (← links)
• On the kernelization complexity of string problems (Q1749539) (← links)
• Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775) (← links)
• Parameterized computational complexity of finding small-diameter subgraphs (Q1758028) (← links)
• Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses (Q5501928) (← links)
• Indistinguishability obfuscation, range avoidance, and bounded arithmetic (Q6499286) (← links)