|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'504'928
Articles rated: 2609
26 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
A Probabilistic Attack on NP-complete Problems | | Alexander Y. Davydov
; | | Date: |
1 Jul 2011 | | Abstract: | Using the probability theory-based approach, this paper reveals the
equivalence of an arbitrary NP-complete problem to a problem of checking
whether a level hypersurface of a specifically constructed harmonic cost
function (with all diagonal entries of its Hessian matrix equal to zero)
intersects with a unit hypercube in many-dimensional Euclidean space. This
connection suggests the possibility that methods of continuous mathematics can
provide crucial insights into the most intriguing open questions in modern
complexity theory. | | Source: | arXiv, 1107.0098 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER