2020-04-15 06:15:59 +0100 | received badge | ● Popular Question (source) |
2019-04-27 14:30:49 +0100 | received badge | ● Organizer (source) |
2019-01-09 20:39:14 +0100 | commented question | Solve MILP by reading LP files Hopefully, someone will look into that (and write a module for it). Nothing so far! |
2018-12-31 00:54:44 +0100 | received badge | ● Nice Question (source) |
2018-12-30 20:23:59 +0100 | asked a question | Solve MILP by reading LP files Sage has a wide range of solvers available to solve MILP problems. However, all these functionalities require that the problem is to be implemented following Sage's API. In contrast, Gurobi allows to solve MILP problems, directly reading from an LP file. This comes in handy, as there's no need to follow Sage API. If the LP file is too large to handle, then the user can simply write another program that will create this file. Apart from being simple and scalable, LP formats can be used for porting to other (unsupported) library. It seems that, Sage does not yet support directly reading LP files. It will be helpful if someone can comment specifically if such functionality is available or will be implemented in near future/a ticket can be initiated. |
2018-02-05 17:02:52 +0100 | commented answer | Truth value of an expression (Boolean Polynomials) Besides, |
2018-02-05 16:56:23 +0100 | commented answer | Truth value of an expression (Boolean Polynomials) Should I create a ticket? |
2018-02-05 16:54:07 +0100 | commented answer | Truth value of an expression (Boolean Polynomials) Another problem, how can I use something like:
|
2018-02-05 16:49:52 +0100 | received badge | ● Popular Question (source) |
2016-08-11 01:24:00 +0100 | received badge | ● Nice Question (source) |
2016-08-06 20:25:00 +0100 | received badge | ● Famous Question (source) |
2016-08-03 19:14:30 +0100 | received badge | ● Student (source) |
2016-08-03 18:17:49 +0100 | received badge | ● Popular Question (source) |
2016-08-03 18:17:49 +0100 | received badge | ● Notable Question (source) |
2016-07-29 08:58:56 +0100 | asked a question | Installing Cryptominisat I am using Linux Mint 17.3 64 bit, and installed sage from PPA as given here: help.ubuntu.com/community/SAGE. Then, I tried to install Cryptominisat package following this: doc.sagemath.org/pdf/en/reference/sat/sat.pdf. However, I get the following error: Later I found out for all |
2014-08-14 21:17:54 +0100 | commented answer | Solving boolean variables symbolically Yes. These expressions are polynomials. |
2014-08-14 15:46:30 +0100 | asked a question | Solving boolean variables symbolically I need to solve some boolean variables symbolically (in terms of the other symbols): Suppose we are given an expression like
Is it possible to do in sage? Something like this, but in boolean variables. |
2014-08-10 08:15:41 +0100 | received badge | ● Editor (source) |
2014-08-10 04:21:15 +0100 | asked a question | How to get the variables present in an boolean expression Consider the boolean variables I need something like What should I do? For a starting point, you may like (copied from the answer given here): |
2014-08-09 08:32:20 +0100 | asked a question | How to count degree of a monomial in boolean polynomial As stated in the title, my question is:
Say, for example, |
2013-11-26 12:32:40 +0100 | commented answer | Truth value of an expression (Boolean Polynomials) @tmonteil Moreover, I found that instead of doing calculations over finite of degree 2, it simply calculates the value!! |
2013-11-26 12:17:18 +0100 | commented answer | Truth value of an expression (Boolean Polynomials) @tmonteil But, more than 256 variables is not allowed in this method! |
2013-11-26 07:33:16 +0100 | commented answer | Truth value of an expression (Boolean Polynomials) @tmonteil Thanks. In my current situation, I get the truth values of the variables from solving a SAT problem. Thus, I have a dictionary like `{s0: True, s1: False}`, I need that these values are put to the expression. But I am stuck with that! Can you help me? |
2013-11-26 03:20:18 +0100 | asked a question | Truth value of an expression (Boolean Polynomials) I need to find the truth value of an expression. Consider this: Now I need |
2013-11-15 06:31:07 +0100 | marked best answer | SAT Solver You can do: It is possible that you will have to install the |
2013-11-03 23:21:52 +0100 | commented answer | SAT Solver output Then why not use `cms()[1:]`? That will simplify the situation. |
2013-11-03 22:44:00 +0100 | asked a question | SAT Solver From the documentation of Say, I need to solve (in a Boolean ring)
Regards. |
2013-11-01 14:11:13 +0100 | received badge | ● Supporter (source) |
2013-11-01 14:09:02 +0100 | received badge | ● Scholar (source) |
2013-11-01 14:09:02 +0100 | marked best answer | SAT Solver output There is no Without the There seems not be any on-line documentation, but you can actually read it from the sage command line, if you type: You will read and |
2013-11-01 02:21:06 +0100 | asked a question | SAT Solver output I need to solve a SAT problem. I searched and found the manual here, but can not figure out the output obtained: There are 3 variables, then what does that |