I'm seeing a lot conflicting info about this problem. With some saying sites it is NP-complete and others saying that it is co-NP-complete. The only real consistent info I can find is that is definitely NP-hard. Which is it? And why?
Related Questions in COMPLEXITY-THEORY
- Given partially sorted array of type x<y => first apperance of x comes before first of y, sort in average O(n)
- What's the complexity of `+=` for a string in Python
- How to find big o of dependent loops and recursive functions?
- Understanding Unary PCP Reduction to a Matching Problem (UPCP)
- How to determine the time complexity of a recursive function that has a loop enclosed in it?
- Does the square root of an input lie in the middle of that input?
- Hash Table creation runtime complexity
- Optimization - Algorithm for finding load set combination that returns the maximum Von Mises stress
- Time complexity of a divide and conquer algorithm that searches for a value in an n x m table, rows and columns are sorted
- Big O notation of string permutation in Python
- finding the time complexity of the program
- how do i find the time complexity (big O) of this triple loop?
- determine the big o running time of the method
- Reduction from Hamiltonian path to Tripartite decision problem
- How to implement the Sosic and Gu linear algorithm for the n-queens problem
Related Questions in NP
- How do I implement the np.argmin function for several dimensions
- i installed numpy 1.26.3 but still not able to use np. method
- K-Hamiltonian Path problem and NP-completeness
- Computational Learning Problem: 3-DNF Reduction
- Editing a clique into a k-plex optimally is NP?
- NP hardness of bin packing with a fixed number of bins
- Example of 3CNF to Hitting set conversion
- Fast algorithm for n-rooks completion puzzle
- Deconstruct a column with dict values into multiple columns in pandas
- How to optimize this set-picking algorithm?
- np.where group multiple columns and pivot
- Getting error: "You must be logged in. Use `npm login` and try again." when trying to publish with NP
- np.load from relative file in the python package
- Searching Algorithm: Product Knapsack Problem with goal to find lowest product above a certain threshold?
- Authentic List of NP, NP Complete and NP Hard problems
Related Questions in SAT
- minimizing a CNF in python
- How to use the Z3 Solver to solve a natural deduction problem
- Are there tools available to convert SMT-LIB files to DIMACS CNF?
- MUS cores in Alloy UNSAT models
- Is there an algorithm to find the union and intersection of 2 given possible binary numbers
- How to Abstract "At Most One" Constraint Across Multiple Time Steps in a SAT Solver?
- Computational Learning Problem: 3-DNF Reduction
- Alloy6 allowing invalid state transitions
- Lion and Unicorn with Prolog SAT Solver
- "Check if a cycle of K nodes exists" reduction to SAT?
- pysmt: how to extract models uniformly at random?
- Specialized SAT solver (?)
- Reversing the CNF conversion after MAXSAT solve
- No output from Z3/SMT solver for weight balancing problem with nested quantifiers
- 3 partition np completeness
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
I think this depends on how you define MAX-3SAT.
If you define MAX-3SAT as the function problem "given a 3CNF formula, produce a variable assignment maximizing the number of satisfied clauses," then it's neither NP-complete nor co-NP-complete. NP and co-NP are classes of decision problems and therefore no function problem can belong to them. Therefore, MAX-3SAT can't belong to NP or co-NP, so it can't be a complete problem for either class. This function problem is NP-hard via a reduction from vanilla 3SAT - if you could find the maximally satisfying assignment, you could check if the original formula was satisfiable by seeing if all clauses were satisfied.
You could also define MAX-3SAT as the decision problem "given a 3CNF formula and a number n, determine whether there's a variable assignment to the formula that makes at least n clauses true." This is definitely in NP and also NP-complete via a reduction from 3SAT.
On the other hand, if you define MAX-3SAT as the decision problem "given a 3CNF formula and a variable assignment to that formula, is that assignment the one that maximizes the number of satisfied clauses?," then it would belong to co-NP (if the answer is no, you could confirm this by exhibiting a better satisfying assignment). I'm not sure if it would be NP-hard, though, and I'm also not sure whether it's co-NP-hard either.
Hope this helps!