cse 373 p vs np
play

CSE 373: P vs NP Michael Lee Monday, Mar 5, 2018 1 Overview - PowerPoint PPT Presentation

Sep 23, 2023 •8 likes •1.23k views

CSE 373: P vs NP Michael Lee Monday, Mar 5, 2018 1 Overview Previously: We spent a lot of time analyzing algorithms 2 We spent a lot of time learning how to solve problems Overview Previously: 2 We spent a lot of time learning how

  1. What is an “effjcient algorithm”? : Yes, it’s a polynomial : Technically yes... : Technically yes... , which is a polynomial Effjcient algorithm 10 Examples: which of these runtime bounds are “effjcient”? An algorithm is effjcient if the worst-case bound is a polynomial . ◮ O � n 2 � ◮ O (2 n ) : No, it’s an exponential ◮ O ( n log ( n )) : Yes, n log ( n ) ∈ O � n 2 � ◮ O � n 10000000 � ◮ O � 30000000000000 n 3 �

  2. What is an “effjcient algorithm”? in practice? No, but... Once we fjnd a polynomial algorithm to a problem, we’ve historically been able to improve it to something reasonable Finding a polynomial runtime is a VERY low bar. If we can’t even get that... 11 Question: Are n 10000000 and 30000000000000 n 3 actually effjcient

  3. What is an “effjcient algorithm”? in practice? No, but... Once we fjnd a polynomial algorithm to a problem, we’ve historically been able to improve it to something reasonable Finding a polynomial runtime is a VERY low bar. If we can’t even get that... 11 Question: Are n 10000000 and 30000000000000 n 3 actually effjcient

  4. What is an “effjcient algorithm”? in practice? No, but... historically been able to improve it to something reasonable Finding a polynomial runtime is a VERY low bar. If we can’t even get that... 11 Question: Are n 10000000 and 30000000000000 n 3 actually effjcient ◮ Once we fjnd a polynomial algorithm to a problem, we’ve

  5. What is an “effjcient algorithm”? in practice? No, but... historically been able to improve it to something reasonable even get that... 11 Question: Are n 10000000 and 30000000000000 n 3 actually effjcient ◮ Once we fjnd a polynomial algorithm to a problem, we’ve ◮ Finding a polynomial runtime is a VERY low bar. If we can’t

  6. Examples of problems Pretty much all problems we’ve studied have effjcient solutions! We’ve studied two main types of algorithms: sorting algorithms and graph algorithms, and every one we’ve looked at so far could run in polynomial time. (e.g “How do I sort this list”, “What is the shortest path”, “What is the MST”...) 12

  7. Examples of problems Pretty much all problems we’ve studied have effjcient solutions! We’ve studied two main types of algorithms: sorting algorithms and graph algorithms, and every one we’ve looked at so far could run in polynomial time. (e.g “How do I sort this list”, “What is the shortest path”, “What is the MST”...) 12

  8. Examples of problems Great: do all solvable problems have effjcient solutions? Haha, no. Well, ok – do all practical problems we actually care about have effjcient solutions? lol 13

  9. Examples of problems Great: do all solvable problems have effjcient solutions? Haha, no. Well, ok – do all practical problems we actually care about have effjcient solutions? lol 13

  10. Examples of problems Great: do all solvable problems have effjcient solutions? Haha, no. Well, ok – do all practical problems we actually care about have effjcient solutions? lol 13

  11. Examples of problems Great: do all solvable problems have effjcient solutions? Haha, no. Well, ok – do all practical problems we actually care about have effjcient solutions? lol 13

  12. LONGEST-PATH PATH vs LONGEST-PATH Given a graph and two vertices, does there exist some path between those two vertices that visits exactly k edges? To solve, run BFS and see if we visit the dest in k edges. We can solve this effjciently! What if we tweak the problem a little? Given a graph, does there exist a path between any two vertices that visits exactly k edges? There is no known effjcient solution to this problem. To solve, use brute force. 14 PATH

  13. LONGEST-PATH PATH vs LONGEST-PATH Given a graph and two vertices, does there exist some path between those two vertices that visits exactly k edges? What if we tweak the problem a little? Given a graph, does there exist a path between any two vertices that visits exactly k edges? There is no known effjcient solution to this problem. To solve, use brute force. 14 PATH ◮ To solve, run BFS and see if we visit the dest in k edges. ◮ We can solve this effjciently!

  14. LONGEST-PATH PATH vs LONGEST-PATH Given a graph and two vertices, does there exist some path between those two vertices that visits exactly k edges? What if we tweak the problem a little? Given a graph, does there exist a path between any two vertices that visits exactly k edges? There is no known effjcient solution to this problem. To solve, use brute force. 14 PATH ◮ To solve, run BFS and see if we visit the dest in k edges. ◮ We can solve this effjciently!

  15. PATH vs LONGEST-PATH Given a graph and two vertices, does there exist some path between those two vertices that visits exactly k edges? What if we tweak the problem a little? Given a graph, does there exist a path between any two vertices that visits exactly k edges? There is no known effjcient solution to this problem. To solve, use brute force. 14 PATH ◮ To solve, run BFS and see if we visit the dest in k edges. ◮ We can solve this effjciently! LONGEST-PATH

  16. PATH vs LONGEST-PATH Given a graph and two vertices, does there exist some path between those two vertices that visits exactly k edges? What if we tweak the problem a little? Given a graph, does there exist a path between any two vertices that visits exactly k edges? There is no known effjcient solution to this problem. To solve, use brute force. 14 PATH ◮ To solve, run BFS and see if we visit the dest in k edges. ◮ We can solve this effjciently! LONGEST-PATH

  17. 3-COLOR 2-COLOR vs 3-COLOR Given a graph, is it possible to assign each node one of two colors such that no two adjacent nodes share the same color? What if we tweak the problem a little? Given a graph, is it possible to assign each node one of three colors such that no two adjacent nodes share the same color?” There is no known effjcient solution to this problem. To solve, use brute force: try all V combinations. 15 2-COLOR ◮ To solve, run BFS or DFS, alternate colors... ◮ We can solve this effjciently!

  18. 3-COLOR 2-COLOR vs 3-COLOR Given a graph, is it possible to assign each node one of two colors such that no two adjacent nodes share the same color? What if we tweak the problem a little? Given a graph, is it possible to assign each node one of three colors such that no two adjacent nodes share the same color?” There is no known effjcient solution to this problem. To solve, use brute force: try all V combinations. 15 2-COLOR ◮ To solve, run BFS or DFS, alternate colors... ◮ We can solve this effjciently!

  19. 2-COLOR vs 3-COLOR Given a graph, is it possible to assign each node one of two colors such that no two adjacent nodes share the same color? What if we tweak the problem a little? Given a graph, is it possible to assign each node one of three colors such that no two adjacent nodes share the same color?” There is no known effjcient solution to this problem. To solve, use brute force: try all V combinations. 15 2-COLOR ◮ To solve, run BFS or DFS, alternate colors... ◮ We can solve this effjciently! 3-COLOR

  20. 2-COLOR vs 3-COLOR Given a graph, is it possible to assign each node one of two colors such that no two adjacent nodes share the same color? What if we tweak the problem a little? Given a graph, is it possible to assign each node one of three colors such that no two adjacent nodes share the same color?” There is no known effjcient solution to this problem. combinations. 15 2-COLOR ◮ To solve, run BFS or DFS, alternate colors... ◮ We can solve this effjciently! 3-COLOR � 3 | V | � To solve, use brute force: try all O

  21. CIRCUIT-SAT Given a boolean expression such as “ a && (b || c) ” and the CIRCUIT-VALUE vs CIRCUIT-SAT truth values for every variable, is the fjnal expression T? To solve, convert into an abstract syntax tree and evaluate. We can solve this effjciently! truth values for some of the variables, is there a way to set the remaining variables so that the output is T? There is no known effjcient solution to this problem. To solve, use brute force: try every combination of variables. 16 CIRCUIT-VALUE Given a boolean expression such as “ a && (b || c) ” and the

  22. CIRCUIT-SAT Given a boolean expression such as “ a && (b || c) ” and the CIRCUIT-VALUE vs CIRCUIT-SAT truth values for every variable, is the fjnal expression T? truth values for some of the variables, is there a way to set the remaining variables so that the output is T? There is no known effjcient solution to this problem. To solve, use brute force: try every combination of variables. 16 CIRCUIT-VALUE Given a boolean expression such as “ a && (b || c) ” and the ◮ To solve, convert into an abstract syntax tree and evaluate. ◮ We can solve this effjciently!

  23. CIRCUIT-VALUE vs CIRCUIT-SAT truth values for every variable, is the fjnal expression T? truth values for some of the variables, is there a way to set the remaining variables so that the output is T? There is no known effjcient solution to this problem. To solve, use brute force: try every combination of variables. 16 CIRCUIT-VALUE Given a boolean expression such as “ a && (b || c) ” and the ◮ To solve, convert into an abstract syntax tree and evaluate. ◮ We can solve this effjciently! CIRCUIT-SAT Given a boolean expression such as “ a && (b || c) ” and the

  24. CIRCUIT-VALUE vs CIRCUIT-SAT truth values for every variable, is the fjnal expression T? truth values for some of the variables, is there a way to set the remaining variables so that the output is T? There is no known effjcient solution to this problem. To solve, use brute force: try every combination of variables. 16 CIRCUIT-VALUE Given a boolean expression such as “ a && (b || c) ” and the ◮ To solve, convert into an abstract syntax tree and evaluate. ◮ We can solve this effjciently! CIRCUIT-SAT Given a boolean expression such as “ a && (b || c) ” and the

  25. Complexity classes Observation: Some problems have polynomial solutions, some have worse. Can we formalize this? Complexity class A complexity class is a set of problems limited by some resource constraint (time, space, etc) 17

  26. Complexity classes Observation: Some problems have polynomial solutions, some have worse. Can we formalize this? Complexity class A complexity class is a set of problems limited by some resource constraint (time, space, etc) 17

  27. Examples: IS-PRIME , IS-SORTED , PATH , 2-COLOR , CIRCUIT-VALUE , Examples: LONGEST-PATH , 3-COLOR , CIRCUIT-SAT ... Complexity class: P and EXP The complexity class P P is the set of all decision problems where there exists an algorithm that can solve all inputs in worst-case polynomial time. ... The complexity class EXP EXP is the set of all decision problems where there exists an algorithm that can solve all inputs in worst-case exponential time. 18

  28. Examples: LONGEST-PATH , 3-COLOR , CIRCUIT-SAT ... Complexity class: P and EXP The complexity class P P is the set of all decision problems where there exists an algorithm that can solve all inputs in worst-case polynomial time. ... The complexity class EXP EXP is the set of all decision problems where there exists an algorithm that can solve all inputs in worst-case exponential time. 18 Examples: IS-PRIME , IS-SORTED , PATH , 2-COLOR , CIRCUIT-VALUE ,

  29. Complexity class: P and EXP The complexity class P P is the set of all decision problems where there exists an algorithm that can solve all inputs in worst-case polynomial time. ... The complexity class EXP EXP is the set of all decision problems where there exists an algorithm that can solve all inputs in worst-case exponential time. 18 Examples: IS-PRIME , IS-SORTED , PATH , 2-COLOR , CIRCUIT-VALUE , Examples: LONGEST-PATH , 3-COLOR , CIRCUIT-SAT ...

  30. Is P a subset of EXP? Question: Suppose we have some random decision problem in P. Is that problem also in EXP? 19 E.g. is 2-COLOR in EXP?

  31. Is P a subset of EXP? There are three reasonable possibilities: Answer 1: The sets are disjoint E.g. if a problem is in P, it’s not in EXP. P EXP Answer 2: The sets overlap E.g. some, but not all problems in P are in EXP P EXP Answer 3: P is a subset of EXP All problems in P are also in EXP P EXP 20

  32. Is P a subset of EXP? There are three reasonable possibilities: Answer 1: The sets are disjoint E.g. if a problem is in P, it’s not in EXP. P EXP Answer 2: The sets overlap E.g. some, but not all problems in P are in EXP P EXP Answer 3: P is a subset of EXP All problems in P are also in EXP P EXP 20

  33. Is P a subset of EXP? There are three reasonable possibilities: Answer 1: The sets are disjoint E.g. if a problem is in P, it’s not in EXP. P EXP Answer 2: The sets overlap E.g. some, but not all problems in P are in EXP P EXP Answer 3: P is a subset of EXP All problems in P are also in EXP P EXP 20

  34. Is P a subset of EXP? It turns out it’s answer 3: P is a subset of EXP. Answer 3: P is a subset of EXP All problems in P are also in EXP P EXP Reason: EXP is the set of decision problems where there exists an algorithm that solves the problem in worst-case exponential time . So, if we can fjnd a polynomial-time algorithm to a problem, we can defjnitely fjnd an exponential one! 21

  35. Is P a subset of EXP? It turns out it’s answer 3: P is a subset of EXP. Answer 3: P is a subset of EXP All problems in P are also in EXP P EXP Reason: EXP is the set of decision problems where there exists an algorithm that solves the problem in worst-case exponential time . So, if we can fjnd a polynomial-time algorithm to a problem, we can defjnitely fjnd an exponential one! 21

  36. Is P a subset of EXP? It turns out it’s answer 3: P is a subset of EXP. Answer 3: P is a subset of EXP All problems in P are also in EXP P EXP Reason: EXP is the set of decision problems where there exists an algorithm that solves the problem in worst-case exponential time . So, if we can fjnd a polynomial-time algorithm to a problem, we can defjnitely fjnd an exponential one! 21

  37. How do we show that IS-PRIME is in EXP? boolean isPrimeSolver2(n): for ( int i = 0; i < Math.pow(2, n); i++): print("lol") return isPrimeSolver(n) So IS-PRIME is also in EXP. Is P a subset of EXP? This runs in exponential time and correctly solves all inputs. 22 check if a number n is prime: Example: We previously showed there exists an O ( n ) algorithm to boolean isPrimeSolver(n): for ( int i = 2; i < n; i++): if (X % i == 0): return false return true So IS-PRIME ∈ P.

  38. boolean isPrimeSolver2(n): for ( int i = 0; i < Math.pow(2, n); i++): print("lol") return isPrimeSolver(n) So IS-PRIME is also in EXP. Is P a subset of EXP? This runs in exponential time and correctly solves all inputs. 22 check if a number n is prime: Example: We previously showed there exists an O ( n ) algorithm to boolean isPrimeSolver(n): for ( int i = 2; i < n; i++): if (X % i == 0): return false return true So IS-PRIME ∈ P. How do we show that IS-PRIME is in EXP?

  39. Is P a subset of EXP? This runs in exponential time and correctly solves all inputs. 22 check if a number n is prime: Example: We previously showed there exists an O ( n ) algorithm to boolean isPrimeSolver(n): for ( int i = 2; i < n; i++): if (X % i == 0): return false return true So IS-PRIME ∈ P. How do we show that IS-PRIME is in EXP? boolean isPrimeSolver2(n): for ( int i = 0; i < Math.pow(2, n); i++): print("lol") return isPrimeSolver(n) So IS-PRIME is also in EXP.

  40. Recap To recap: What does it mean to “solve” a decision problem? What does it mean for an algorithm to be “effjcient”? What is a complexity class? P EXP P is a subset of EXP Unfortunately, some problems we care about are in EXP 23 ◮ What is a decision problem?

  41. Recap To recap: What does it mean for an algorithm to be “effjcient”? What is a complexity class? P EXP P is a subset of EXP Unfortunately, some problems we care about are in EXP 23 ◮ What is a decision problem? ◮ What does it mean to “solve” a decision problem?

  42. Recap To recap: What is a complexity class? P EXP P is a subset of EXP Unfortunately, some problems we care about are in EXP 23 ◮ What is a decision problem? ◮ What does it mean to “solve” a decision problem? ◮ What does it mean for an algorithm to be “effjcient”?

  43. Recap To recap: P EXP P is a subset of EXP Unfortunately, some problems we care about are in EXP 23 ◮ What is a decision problem? ◮ What does it mean to “solve” a decision problem? ◮ What does it mean for an algorithm to be “effjcient”? ◮ What is a complexity class?

  44. Recap To recap: EXP P is a subset of EXP Unfortunately, some problems we care about are in EXP 23 ◮ What is a decision problem? ◮ What does it mean to “solve” a decision problem? ◮ What does it mean for an algorithm to be “effjcient”? ◮ What is a complexity class? ◮ P

  45. Recap To recap: P is a subset of EXP Unfortunately, some problems we care about are in EXP 23 ◮ What is a decision problem? ◮ What does it mean to “solve” a decision problem? ◮ What does it mean for an algorithm to be “effjcient”? ◮ What is a complexity class? ◮ P ◮ EXP

  46. Recap To recap: Unfortunately, some problems we care about are in EXP 23 ◮ What is a decision problem? ◮ What does it mean to “solve” a decision problem? ◮ What does it mean for an algorithm to be “effjcient”? ◮ What is a complexity class? ◮ P ◮ EXP ◮ P is a subset of EXP

  47. Recap To recap: 23 ◮ What is a decision problem? ◮ What does it mean to “solve” a decision problem? ◮ What does it mean for an algorithm to be “effjcient”? ◮ What is a complexity class? ◮ P ◮ EXP ◮ P is a subset of EXP ◮ Unfortunately, some problems we care about are in EXP

  48. A glimmer of hope... Observation: Some problems in EXP have an interesting property: They may take either polynomial or exponential time to solve , but either way... Checking or verifying if a solution is correct always takes polynomial time! Big idea: NP is the set of decision problems that can be verifjed in polynomial time. If we can verify answers effjciently, can we fjnd answers effjciently? 24

  49. A glimmer of hope... Observation: Some problems in EXP have an interesting property: but either way... Checking or verifying if a solution is correct always takes polynomial time! Big idea: NP is the set of decision problems that can be verifjed in polynomial time. If we can verify answers effjciently, can we fjnd answers effjciently? 24 ◮ They may take either polynomial or exponential time to solve ,

  50. A glimmer of hope... Observation: Some problems in EXP have an interesting property: but either way... polynomial time! Big idea: NP is the set of decision problems that can be verifjed in polynomial time. If we can verify answers effjciently, can we fjnd answers effjciently? 24 ◮ They may take either polynomial or exponential time to solve , ◮ Checking or verifying if a solution is correct always takes

  51. A glimmer of hope... Observation: Some problems in EXP have an interesting property: but either way... polynomial time! Big idea: NP is the set of decision problems that can be verifjed in polynomial time. If we can verify answers effjciently, can we fjnd answers effjciently? 24 ◮ They may take either polynomial or exponential time to solve , ◮ Checking or verifying if a solution is correct always takes

  52. A glimmer of hope... Observation: Some problems in EXP have an interesting property: but either way... polynomial time! Big idea: NP is the set of decision problems that can be verifjed in polynomial time. If we can verify answers effjciently, can we fjnd answers effjciently? 24 ◮ They may take either polynomial or exponential time to solve , ◮ Checking or verifying if a solution is correct always takes

  53. Solving vs verifying Reminder: a solver is an algorithm that accepts an instance of a decision-problem and returns true or false. Another kind of algorithm – a verifjer Verifjer A verifjer accepts as input: 1. Some instance of the decision problem 2. Some sort of “proof” or certifjcate of why the solver made whatever decision it made on that instance. 25

  54. Solving vs verifying Reminder: a solver is an algorithm that accepts an instance of a decision-problem and returns true or false. Another kind of algorithm – a verifjer Verifjer A verifjer accepts as input: 1. Some instance of the decision problem 2. Some sort of “proof” or certifjcate of why the solver made whatever decision it made on that instance. 25

  55. Solving vs verifying Reminder: a solver is an algorithm that accepts an instance of a decision-problem and returns true or false. Another kind of algorithm – a verifjer Verifjer A verifjer accepts as input: 1. Some instance of the decision problem 2. Some sort of “proof” or certifjcate of why the solver made whatever decision it made on that instance. 25

  56. Solving vs verifying Reminder: a solver is an algorithm that accepts an instance of a decision-problem and returns true or false. Another kind of algorithm – a verifjer Verifjer A verifjer accepts as input: 1. Some instance of the decision problem 2. Some sort of “proof” or certifjcate of why the solver made whatever decision it made on that instance. 25

  57. Solving vs verifying Reminder: a solver is an algorithm that accepts an instance of a decision-problem and returns true or false. Another kind of algorithm – a verifjer Verifjer A verifjer accepts as input: 1. Some instance of the decision problem 2. Some sort of “proof” or certifjcate of why the solver made whatever decision it made on that instance. 25

  58. The complexity class NP The complexity class NP Suppose that we have some decision problem X where... That solver says “yes” for some instance of X Whenever the solver says “yes”, it also returns some sort of “proof” or certifjcate of why they said “yes”. If there exists a verifjer that... When given the instance and the certifjcate, always agrees the correct answer was “yes” Always runs in polynomial time ...then X is in NP. 26 ◮ There exists some solver for X

  59. The complexity class NP The complexity class NP Suppose that we have some decision problem X where... Whenever the solver says “yes”, it also returns some sort of “proof” or certifjcate of why they said “yes”. If there exists a verifjer that... When given the instance and the certifjcate, always agrees the correct answer was “yes” Always runs in polynomial time ...then X is in NP. 26 ◮ There exists some solver for X ◮ That solver says “yes” for some instance of X

  60. The complexity class NP The complexity class NP Suppose that we have some decision problem X where... “proof” or certifjcate of why they said “yes”. If there exists a verifjer that... When given the instance and the certifjcate, always agrees the correct answer was “yes” Always runs in polynomial time ...then X is in NP. 26 ◮ There exists some solver for X ◮ That solver says “yes” for some instance of X ◮ Whenever the solver says “yes”, it also returns some sort of

  61. The complexity class NP The complexity class NP Suppose that we have some decision problem X where... “proof” or certifjcate of why they said “yes”. If there exists a verifjer that... When given the instance and the certifjcate, always agrees the correct answer was “yes” Always runs in polynomial time ...then X is in NP. 26 ◮ There exists some solver for X ◮ That solver says “yes” for some instance of X ◮ Whenever the solver says “yes”, it also returns some sort of

  62. The complexity class NP The complexity class NP Suppose that we have some decision problem X where... “proof” or certifjcate of why they said “yes”. If there exists a verifjer that... correct answer was “yes” Always runs in polynomial time ...then X is in NP. 26 ◮ There exists some solver for X ◮ That solver says “yes” for some instance of X ◮ Whenever the solver says “yes”, it also returns some sort of ◮ When given the instance and the certifjcate, always agrees the

  63. The complexity class NP The complexity class NP Suppose that we have some decision problem X where... “proof” or certifjcate of why they said “yes”. If there exists a verifjer that... correct answer was “yes” ...then X is in NP. 26 ◮ There exists some solver for X ◮ That solver says “yes” for some instance of X ◮ Whenever the solver says “yes”, it also returns some sort of ◮ When given the instance and the certifjcate, always agrees the ◮ Always runs in polynomial time

  64. The complexity class NP The complexity class NP Suppose that we have some decision problem X where... “proof” or certifjcate of why they said “yes”. If there exists a verifjer that... correct answer was “yes” ...then X is in NP. 26 ◮ There exists some solver for X ◮ That solver says “yes” for some instance of X ◮ Whenever the solver says “yes”, it also returns some sort of ◮ When given the instance and the certifjcate, always agrees the ◮ Always runs in polynomial time

  65. The complexity class co-NP Important note: The verifjer only needs to exist when the solver says “yes”. If the solver says “no”, we don’t care. A related complexity class: co-NP. Almost identical to NP, except for “NO” instances. 27

  66. The complexity class co-NP Important note: The verifjer only needs to exist when the solver says “yes”. If the solver says “no”, we don’t care. A related complexity class: co-NP. Almost identical to NP, except for “NO” instances. 27

  67. The complexity class co-NP The complexity class co-NP Suppose that we have some decision problem X where... That solver says “no” for some instance of X Whenever the solver says “no”, it also returns some sort of “proof” or certifjcate of why they said “no” . If there exists a verifjer that... When given the instance and the certifjcate, always agrees the correct answer was “no” Always runs in polynomial time ...then X is in co-NP . 28 ◮ There exists some solver for X

  68. The complexity class co-NP The complexity class co-NP Suppose that we have some decision problem X where... Whenever the solver says “no”, it also returns some sort of “proof” or certifjcate of why they said “no” . If there exists a verifjer that... When given the instance and the certifjcate, always agrees the correct answer was “no” Always runs in polynomial time ...then X is in co-NP . 28 ◮ There exists some solver for X ◮ That solver says “no” for some instance of X

  69. The complexity class co-NP The complexity class co-NP Suppose that we have some decision problem X where... “proof” or certifjcate of why they said “no” . If there exists a verifjer that... When given the instance and the certifjcate, always agrees the correct answer was “no” Always runs in polynomial time ...then X is in co-NP . 28 ◮ There exists some solver for X ◮ That solver says “no” for some instance of X ◮ Whenever the solver says “no”, it also returns some sort of

  70. The complexity class co-NP The complexity class co-NP Suppose that we have some decision problem X where... “proof” or certifjcate of why they said “no” . If there exists a verifjer that... When given the instance and the certifjcate, always agrees the correct answer was “no” Always runs in polynomial time ...then X is in co-NP . 28 ◮ There exists some solver for X ◮ That solver says “no” for some instance of X ◮ Whenever the solver says “no”, it also returns some sort of

Recommend

More recommend