Sparse NP-complete problems over the reals with addition

DOI10.1016/S0304-3975(00)00203-6MaRDI QIDQ5941089zbMATH OpenWikidataFDO

Authors Hervé Fournier

Publication date 20 August 2001

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(00)00203-6

zbMATH Keywords

knapsackreal complexitysparse sets

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• On sparseness, reducibilities, and complexity
• Complexity and dimension
• Two Results on Polynomial Time Truth-Table Reductions to Sparse Sets
• On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets
• On Sparse Complete Sets

Cites work

• Complexity and dimension
• scientific article; zbMATH DE number 1670874 (Why is no real title available?)
• scientific article; zbMATH DE number 1072529 (Why is no real title available?)
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines

Cited in

(5)

• On the computational structure of the connected components of a hard problem
• On sparseness, reducibilities, and complexity
• Constraint satisfaction and semilinear expansions of addition over the rationals and the reals
• Complexity and dimension
• On sparseness and Turing reducibility over the reals

This page was built for publication: Sparse NP-complete problems over the reals with addition

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