Some Theorems Concerning the Core Function

DOI10.1007/978-3-540-68679-8_48MaRDI QIDQ3507402zbMATH OpenOpenAlexFDO

Authors Angelo Raffaele Meo

Publication date 19 June 2008

Published in Concurrency, Graphs and Models (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-68679-8_48

Mathematics Subject Classification ID

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

Recommendations

• On the P vs NP question: a proof of inequality
• scientific article; zbMATH DE number 3867065
• A simplified NP-complete satisfiability problem
• The complexity of satisfiability problems
• On inefficient special cases of NP-complete problems

Cited in

(3)

• Inner-core and outer-core functions of partially defined Boolean functions
• scientific article; zbMATH DE number 1588478 (Why is no real title available?)
• scientific article; zbMATH DE number 6026915 (Why is no real title available?)

This page was built for publication: Some Theorems Concerning the Core Function

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