Recent Developments in the Theory of Pre-processing

DOI10.1007/978-3-642-21204-8_2MaRDI QIDQ3004648zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Michael R. Fellows

Publication date 3 June 2011

Published in Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-21204-8_2

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The potential and perils of preprocessing: building new foundations
• Toward a theory of information processing
• Receptive process theory
• scientific article; zbMATH DE number 7561745
• scientific article; zbMATH DE number 4080894

Cited in

(7)

• Preprocessing of intractable problems
• Kernelization -- preprocessing with a guarantee
• Monotonic reductions, representative equivalence, and compilation of intractable problems
• The Lost Continent of Polynomial Time: Preprocessing and Kernelization
• Kernelization. Theory of parameterized preprocessing
• Recent developments in kernelization: a survey
• Receptive process theory

This page was built for publication: Recent Developments in the Theory of Pre-processing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3004648)