Pages that link to "Item:Q3449566"

The following pages link to New Limits to Classical and Quantum Instance Compression (Q3449566):

Displaying 31 items.

• Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
• AND-compression of NP-complete problems: streamlined proof and minor observations (Q309801) (← links)
• On cutwidth parameterized by vertex cover (Q476444) (← links)
• Parameterized complexity of critical node cuts (Q517024) (← links)
• Best-case and worst-case sparsifiability of Boolean CSPs (Q786033) (← links)
• On the approximate compressibility of connected vertex cover (Q2006945) (← links)
• On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering (Q2034395) (← links)
• On fixed-order book thickness parameterized by the pathwidth of the vertex ordering (Q2039665) (← links)
• Public-coin statistical zero-knowledge batch verification against malicious verifiers (Q2056790) (← links)
• On some FPT problems without polynomial Turing compressions (Q2072079) (← links)
• A polynomial kernel for bipartite permutation vertex deletion (Q2093571) (← links)
• Multistage vertex cover (Q2135630) (← links)
• Polynomial kernels for hitting forbidden minors under structural parameterizations (Q2202024) (← links)
• Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes (Q2272981) (← links)
• Preprocessing to reduce the search space: antler structures for feedback vertex set (Q2672419) (← links)
• Parameterized complexity of \textsc{bandwidth} of \textsc{caterpillars} and \textsc{weighted path emulation} (Q2672420) (← links)
• Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
• On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs (Q2958335) (← links)
• Complexity with Rod (Q2970952) (← links)
• Kernelization of Cycle Packing with Relaxed Disjointness Constraints (Q3174716) (← links)
• Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061) (← links)
• Fractals for Kernelization Lower Bounds (Q4609787) (← links)
• Generalized Quantum Arthur--Merlin Games (Q4634057) (← links)
• Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)
• Hans Bodlaender and the Theory of Kernelization Lower Bounds (Q5042447) (← links)
• (Q5075825) (← links)
• A deterministic polynomial kernel for odd cycle transversal and vertex multiway cut in planar graphs (Q5090489) (← links)
• (Q5091010) (← links)
• A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs (Q5163509) (← links)
• Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes (Q5738792) (← links)
• Multistage \(s-t\) path: confronting similarity with dissimilarity (Q6107891) (← links)