# Tricritical points in random combinatorics: the -SAT case

@inproceedings{Monasson1998TricriticalPI, title={Tricritical points in random combinatorics: the -SAT case}, author={R{\'e}mi Monasson and Riccardo Zecchina}, year={1998} }

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.

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 14 CITATIONS

## Unsatisfiability Bounds for Random CSPs from an Energetic Interpolation Method

VIEW 1 EXCERPT

CITES BACKGROUND

## A pr 2 00 7 The Phase Diagram of 1-in3 Satisfiability Problem

VIEW 3 EXCERPTS

CITES BACKGROUND, METHODS & RESULTS

## Computational complexity of some restricted instances of 3-SAT

VIEW 1 EXCERPT

CITES RESULTS