Sparse NP-complete problems over the reals with addition

DOI10.1016/S0304-3975(00)00203-6zbMath0973.68074WikidataQ126644599 ScholiaQ126644599MaRDI QIDQ5941089

Hervé Fournier

Publication date: 20 August 2001

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

zbMATH Keywords

knapsackreal complexitysparse sets

Mathematics Subject Classification ID

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

Related Items (2)

On sparseness and Turing reducibility over the reals ⋮ On sparseness, reducibilities, and complexity

Cites Work

• Complexity and dimension
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Unnamed Item
• Unnamed Item

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