Universal resolution for NP-complete problems

DOI10.1016/S0304-3975(97)00029-7zbMath0911.68102MaRDI QIDQ1129008

Natacha Portier

Publication date: 13 August 1998

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

zbMATH Keywords

complexityneural networkreductionNP-completeness

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Universal relations and {\#}P-completeness ⋮ Counting problems over the reals

Cites Work

• Accessible telephone directories
• 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: Universal resolution for NP-complete problems