Approximating the Satisfiability Threshold for Random k-XOR-formulas

DOI10.1017/S0963548302005552zbMath1034.68048OpenAlexW2160560721MaRDI QIDQ4802163

Nadia Creignou, Hervé Daudé, Olivier Dubois

Publication date: 2003

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548302005552

zbMATH Keywords

\(k\)-CNF-formulasrandom linear systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (3)

On the phase transitions of random \(k\)-constraint satisfaction problems ⋮ 2-Xor revisited: satisfiability and probabilities of functions ⋮ Совместность случайных систем уравнений с неравновероятной выборкой двузначных неизвестных

This page was built for publication: Approximating the Satisfiability Threshold for Random k-XOR-formulas