3-SAT with few variables
$begingroup$
I am wondering what is the complexity status of 3-SAT when the number of variables is small compare to the number of clauses.
Let n be the number of variables plus the number of clauses.
It is clear that if the number of variables is a constant, then we can brutally solve the problem. It is actually still the case when the number of variable is a O(log n). Does it become NP-c as soon as the number of variables is a asymptotically larger then log n?
Thanks!
combinatorics algorithms computational-complexity satisfiability
asked Jan 24 at 16:16
Pierre AboulkerPierre Aboulker
11
$endgroup$
add a comment |
$begingroup$
I am wondering what is the complexity status of 3-SAT when the number of variables is small compare to the number of clauses.
Let n be the number of variables plus the number of clauses.
It is clear that if the number of variables is a constant, then we can brutally solve the problem. It is actually still the case when the number of variable is a O(log n). Does it become NP-c as soon as the number of variables is a asymptotically larger then log n?
Thanks!
combinatorics algorithms computational-complexity satisfiability
asked Jan 24 at 16:16
Pierre AboulkerPierre Aboulker
11
$endgroup$
$begingroup$
Maybe you want to look into “satisfiability threshhold conjecture”.
$endgroup$
– MJD
Jan 24 at 17:41
$begingroup$
Or ask this on cs.stackexchange instead?
$endgroup$
– MJD
Jan 25 at 6:57
add a comment |
$begingroup$
I am wondering what is the complexity status of 3-SAT when the number of variables is small compare to the number of clauses.
Let n be the number of variables plus the number of clauses.
It is clear that if the number of variables is a constant, then we can brutally solve the problem. It is actually still the case when the number of variable is a O(log n). Does it become NP-c as soon as the number of variables is a asymptotically larger then log n?
Thanks!
combinatorics algorithms computational-complexity satisfiability
asked Jan 24 at 16:16
Pierre AboulkerPierre Aboulker
11
$endgroup$
I am wondering what is the complexity status of 3-SAT when the number of variables is small compare to the number of clauses.
Let n be the number of variables plus the number of clauses.
It is clear that if the number of variables is a constant, then we can brutally solve the problem. It is actually still the case when the number of variable is a O(log n). Does it become NP-c as soon as the number of variables is a asymptotically larger then log n?
Thanks!
combinatorics algorithms computational-complexity satisfiability
combinatorics algorithms computational-complexity satisfiability
asked Jan 24 at 16:16
Pierre AboulkerPierre Aboulker
11
asked Jan 24 at 16:16
Pierre AboulkerPierre Aboulker
11
asked Jan 24 at 16:16
Pierre AboulkerPierre Aboulker
11
asked Jan 24 at 16:16
Pierre AboulkerPierre Aboulker
11
asked Jan 24 at 16:16
Pierre AboulkerPierre Aboulker
11
11
$begingroup$
Maybe you want to look into “satisfiability threshhold conjecture”.
$endgroup$
– MJD
Jan 24 at 17:41
$begingroup$
Or ask this on cs.stackexchange instead?
$endgroup$
– MJD
Jan 25 at 6:57
add a comment |
$begingroup$
Maybe you want to look into “satisfiability threshhold conjecture”.
$endgroup$
– MJD
Jan 24 at 17:41
$begingroup$
Or ask this on cs.stackexchange instead?
$endgroup$
– MJD
Jan 25 at 6:57
$begingroup$
Maybe you want to look into “satisfiability threshhold conjecture”.
$endgroup$
– MJD
Jan 24 at 17:41
$begingroup$
Maybe you want to look into “satisfiability threshhold conjecture”.
$endgroup$
– MJD
Jan 24 at 17:41
$begingroup$
Or ask this on cs.stackexchange instead?
$endgroup$
– MJD
Jan 25 at 6:57
$begingroup$
Or ask this on cs.stackexchange instead?
$endgroup$
– MJD
Jan 25 at 6:57
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3086058%2f3-sat-with-few-variables%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3086058%2f3-sat-with-few-variables%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
Maybe you want to look into “satisfiability threshhold conjecture”.
$endgroup$
– MJD
Jan 24 at 17:41
$begingroup$
Or ask this on cs.stackexchange instead?
$endgroup$
– MJD
Jan 25 at 6:57