News for hackers. Stuff that matters.
Re:Modern SAT solvers: fast, neat and underused (2018) by waldrews on Sunday May 28, 2023 @04:49PM (#36107657)
Should 'formal methods courses' go with 'proving NP-completeness' and 'algo courses' go with 'using SAT solvers?'
Re:Modern SAT solvers: fast, neat and underused (2018) by dataflow on Sunday May 28, 2023 @04:53PM (#36107693)
No. Algorithms courses focus on computability and complexity (including NP-completeness); they don't generally focus on SAT solving. Formal methods are the ones that use SAT solving, SMT solving, etc. to formally prove correctness.
Re:Modern SAT solvers: fast, neat and underused (2018) by waldrews on Monday June 05, 2023 @12:14AM (#36192175)
Ah, thank you. We had theory classes with automata and reductions and complexity proofs, and then algorithms classes that covered some solving techniques. I think I mixed up Formal Methods with Theory.