Proposes a finite algorithmics framework and automatic discovery method to solve bounded cases of NP-complete problems more efficiently than their asymptotic versions.
and Athanas, P., 2017
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Towards Solving NP-Complete and Other Hard Problems Efficiently in Practice
Proposes a finite algorithmics framework and automatic discovery method to solve bounded cases of NP-complete problems more efficiently than their asymptotic versions.