On kernelization with access to NP-oracles
From MaRDI portal
Cites work
- 50 Years of Integer Programming 1958-2008
- A survey on multi-constrained optimal path computation: exact and approximate algorithms
- Advice classes of parametrized tractability
- Anatomy and empirical evaluation of modern SAT solvers
- AND-compression of NP-complete problems: streamlined proof and minor observations
- Computational Complexity
- Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits
- Computing kernels in parallel: lower and upper bounds
- Dynamic Parameterized Problems and Algorithms
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Fixed-parameter tractable reductions to SAT
- Fundamentals of parameterized complexity
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Infeasibility of instance compression and succinct PCPs for NP
- Integer Programming with a Fixed Number of Variables
- Kernelization -- preprocessing with a guarantee
- Kernelization Lower Bounds by Cross-Composition
- Kernelization of counting problems
- Kernelization. Theory of parameterized preprocessing
- Lossy kernelization
- Machine characterizations for parameterized complexity classes beyond para-NP
- Meta-theorems for parameterized streaming algorithms
- New limits to classical and quantum instance compression
- On problems without polynomial kernels
- On the complexity of reconfiguration problems
- On the kernel size of clique cover reductions for random intersection graphs
- On the parameterized complexity of reconfiguration problems
- Paradigms for parameterized enumeration
- Parameterized algorithms
- Parameterized complexity classes beyond para-NP
- Parameterized complexity in the polynomial hierarchy. Extending parameterized complexity theory to higher levels of the hierarchy
- Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation
- Parameterized random complexity
- Parametrized complexity theory.
- Propositional truth maintenance systems: Classification and complexity analysis
- Recent developments in kernelization: a survey
- Reducibility among combinatorial problems
- Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
- Streaming kernelization
- The Lost Continent of Polynomial Time: Preprocessing and Kernelization
- The polynomial-time hierarchy
- The union of minimal hitting sets: parameterized combinatorial bounds and counting
This page was built for publication: On kernelization with access to NP-oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7316952)
