| | |
| | |
Stat |
Members: 3645 Articles: 2'506'133 Articles rated: 2609
27 April 2024 |
|
| | | |
|
Article overview
| |
|
Tricritical Points in Random Combinatorics: the (2+p)-SAT case | Remi Monasson
; Riccardo Zecchina
; | Date: |
1 Oct 1998 | Subject: | Disordered Systems and Neural Networks | cond-mat.dis-nn | Affiliation: | ENS, Paris), Riccardo Zecchina (ICTP, Trieste | Abstract: | The (2+p)-Satisfiability (SAT) problem interpolates between different classes of complexity theory and is believed to be of basic interest in understanding the onset of typical case complexity in random combinatorics. In this paper, a tricritical point in the phase diagram of the random $2+p$-SAT problem is analytically computed using the replica approach and found to lie in the range $2/5 le p_0 le 0.416$. These bounds on $p_0$ are in agreement with previous numerical simulations and rigorous results. | Source: | arXiv, cond-mat/9810008 | 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:
| |