Re: Probable NP-completness of constraints satisfiability check

2025-02-18 Thread Štefan Miklošovič
duplicities => duplicates :D Brandon spotted I was using this word some time ago wrongly. On Wed, Feb 19, 2025 at 6:37 AM Štefan Miklošovič wrote: > Great resources, thanks for that. > > It is not immediately obvious to me that this is 2-SAT but I do agree that > this is a CSP (Constraint satisf

Re: Probable NP-completness of constraints satisfiability check

2025-02-18 Thread Štefan Miklošovič
Great resources, thanks for that. It is not immediately obvious to me that this is 2-SAT but I do agree that this is a CSP (Constraint satisfaction problem). Merely looking into that, my gut feeling is that this might be somehow polynomial but the examples of practically-solvable CSPs are related

Re: Probable NP-completness of constraints satisfiability check

2025-02-18 Thread Štefan Miklošovič
Sorry, CEP-42 On Tue, Feb 18, 2025 at 8:54 PM Štefan Miklošovič wrote: > Hi list, > > We are doing good progress together with Bernardo when it comes to > constraints which were merged recently (CEP-24). > > What I do now is that I try to "harden" it a little bit. If you think > about that, a us

Probable NP-completness of constraints satisfiability check

2025-02-18 Thread Štefan Miklošovič
Hi list, We are doing good progress together with Bernardo when it comes to constraints which were merged recently (CEP-24). What I do now is that I try to "harden" it a little bit. If you think about that, a user could do something like this (currently) ALTER TABLE ks.tb ALTER column1 CHECK col

Re: Probable NP-completness of constraints satisfiability check

2025-02-18 Thread Dmitry Konstantinov
Hi, are you sure you want to go that deep? :-) https://en.wikipedia.org/wiki/Constraint_satisfaction_problem https://en.wikipedia.org/wiki/2-satisfiability (an example what quite a small change in constraints can change the picture dramatically: once we moved from 3SAT to 2SAT - it is polynomial).