A note on random \(k\)-SAT for moderately growing \(k\) (Q426783): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / author | |||
Property / author: Jun Liu / rank | |||
Normal rank | |||
Property / review text | |||
Summary: Consider a random instance \(I\) of \(k\)-SAT with \(n\) variables and \(m\) clauses. Suppose that \(\theta, c>0\) are any fixed real numbers. Let \(k=k(n)\geq \big(\frac{1}{2}+\theta\big)\log_{2}n\). We prove that \[ \lim_{n\rightarrow\infty}\operatorname{Pr}(I\;\text{is satifiable})=\begin{cases} 1\quad m\leq\big(1-\frac{c}{\sqrt{n}}\big)2^{k}n\ln 2 \\0\quad m\geq\big(1+\frac{c}{\sqrt{n}}\big)2^{k}n\ln 2.\end{cases} \] | |||
Property / review text: Summary: Consider a random instance \(I\) of \(k\)-SAT with \(n\) variables and \(m\) clauses. Suppose that \(\theta, c>0\) are any fixed real numbers. Let \(k=k(n)\geq \big(\frac{1}{2}+\theta\big)\log_{2}n\). We prove that \[ \lim_{n\rightarrow\infty}\operatorname{Pr}(I\;\text{is satifiable})=\begin{cases} 1\quad m\leq\big(1-\frac{c}{\sqrt{n}}\big)2^{k}n\ln 2 \\0\quad m\geq\big(1+\frac{c}{\sqrt{n}}\big)2^{k}n\ln 2.\end{cases} \] / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q87 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05D40 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6045648 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
k-SAT | |||
Property / zbMATH Keywords: k-SAT / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
phase transition | |||
Property / zbMATH Keywords: phase transition / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
second moment method | |||
Property / zbMATH Keywords: second moment method / rank | |||
Normal rank |
Revision as of 22:57, 29 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on random \(k\)-SAT for moderately growing \(k\) |
scientific article |
Statements
A note on random \(k\)-SAT for moderately growing \(k\) (English)
0 references
12 June 2012
0 references
Summary: Consider a random instance \(I\) of \(k\)-SAT with \(n\) variables and \(m\) clauses. Suppose that \(\theta, c>0\) are any fixed real numbers. Let \(k=k(n)\geq \big(\frac{1}{2}+\theta\big)\log_{2}n\). We prove that \[ \lim_{n\rightarrow\infty}\operatorname{Pr}(I\;\text{is satifiable})=\begin{cases} 1\quad m\leq\big(1-\frac{c}{\sqrt{n}}\big)2^{k}n\ln 2 \\0\quad m\geq\big(1+\frac{c}{\sqrt{n}}\big)2^{k}n\ln 2.\end{cases} \]
0 references
k-SAT
0 references
phase transition
0 references
second moment method
0 references