On the Effective Enumerability of NP Problems

DOI10.1007/11847250_20MaRDI QIDQ3499739zbMATH OpenOpenAlexFDO

Authors Jie Meng, Ge Xia, Fenghui Zhang, Jianer Chen, Iyad Kanj

Publication date 3 June 2008

Published in Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11847250_20

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Approximate counting and NP search problems
• A recursion-theoretic approach to NP
• Characterization of the effective computability in \({\mathfrak f}\)-enumerations
• On Nondeterminism, Enumeration Reducibility and Polynomial Bounds
• scientific article; zbMATH DE number 1775419
• scientific article; zbMATH DE number 3978381
• Logical Approaches to Computational Barriers
• An inductive number-theoretic characterization of NP

Cited in

(2)

• The union of minimal hitting sets: parameterized combinatorial bounds and counting
• An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set

This page was built for publication: On the Effective Enumerability of NP Problems

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