| Автор | Rémi Monasson |
| Автор | Riccardo Zecchina |
| Дата выпуска | 1998-11-20 |
| dc.description | The -satisfiability (SAT) problem interpolates between different classes of complexity theory and is thought 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 -SAT problem is analytically computed using the replica approach and found to lie in the range . These bounds on are in agreement with previous numerical simulations and rigorous results. |
| Формат | application.pdf |
| Издатель | Institute of Physics Publishing |
| Название | Tricritical points in random combinatorics: the -SAT case |
| Тип | paper |
| DOI | 10.1088/0305-4470/31/46/011 |
| Print ISSN | 0305-4470 |
| Журнал | Journal of Physics A: Mathematical and General |
| Том | 31 |
| Первая страница | 9209 |
| Последняя страница | 9217 |
| Выпуск | 46 |
