Timeline for Algorithm to find if there exists an assignment such that all equality and inequality constraints are satisfied
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 13, 2022 at 16:29 | comment | added | Rami Hashan | Thanks a lot. The explanation was great! | |
| Sep 13, 2022 at 16:29 | vote | accept | Rami Hashan | ||
| Sep 13, 2022 at 16:16 | comment | added | John L. | @RamiHashan please check my updated answer. | |
| Sep 13, 2022 at 16:09 | history | edited | John L. | CC BY-SA 4.0 |
Added time analysis.
|
| Sep 13, 2022 at 16:01 | history | edited | John L. | CC BY-SA 4.0 |
Correction.
|
| Sep 13, 2022 at 15:56 | history | edited | John L. | CC BY-SA 4.0 |
Correction.
|
| Sep 13, 2022 at 14:51 | comment | added | Rami Hashan | Then again, why would the algorithm fail in the first place? In the given example I'd get $x_1=1,x_2=2,x_3=3$ and the case where $x_1\neq x_3$ would check out. | |
| Sep 13, 2022 at 14:48 | comment | added | John L. | Wait, the updated algorithm may fail, too. For example, $x_1=x_3$, $x_2=x_3$. | |
| Sep 13, 2022 at 14:25 | comment | added | Rami Hashan | Oh I see that now. Thank you for the response. Appreciate it! | |
| Sep 13, 2022 at 14:09 | history | answered | John L. | CC BY-SA 4.0 |