20200414 23:15:59 0500  received badge  ● Popular Question (source) 
20190427 07:30:49 0500  received badge  ● Organizer (source) 
20190109 13:39:14 0500  commented question  Solve MILP by reading LP files Hopefully, someone will look into that (and write a module for it). Nothing so far! 
20181230 17:54:44 0500  received badge  ● Nice Question (source) 
20181230 13:23:59 0500  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. 
20180205 10:02:52 0500  commented answer  Truth value of an expression (Boolean Polynomials) Besides, 
20180205 09:56:23 0500  commented answer  Truth value of an expression (Boolean Polynomials) Should I create a ticket? 
20180205 09:54:07 0500  commented answer  Truth value of an expression (Boolean Polynomials) Another problem, how can I use something like:

20180205 09:49:52 0500  received badge  ● Popular Question (source) 
20160810 18:24:00 0500  received badge  ● Nice Question (source) 
20160806 13:25:00 0500  received badge  ● Famous Question (source) 
20160803 12:14:30 0500  received badge  ● Student (source) 
20160803 11:17:49 0500  received badge  ● Notable Question (source) 
20160803 11:17:49 0500  received badge  ● Popular Question (source) 
20160729 01:58:56 0500  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 
20140814 14:17:54 0500  commented answer  Solving boolean variables symbolically Yes. These expressions are polynomials. 
20140814 08:46:30 0500  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. 
20140810 01:15:41 0500  received badge  ● Editor (source) 
20140809 21:21:15 0500  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): 
20140809 01:32:20 0500  asked a question  How to count degree of a monomial in boolean polynomial As stated in the title, my question is:
Say, for example, 
20131126 05:32:40 0500  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!! 
20131126 05:17:18 0500  commented answer  Truth value of an expression (Boolean Polynomials) @tmonteil But, more than 256 variables is not allowed in this method! 
20131126 00:33:16 0500  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? 
20131125 20:20:18 0500  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 
20131114 23:31:07 0500  marked best answer  SAT Solver You can do: It is possible that you will have to install the 
20131103 16:21:52 0500  commented answer  SAT Solver output Then why not use `cms()[1:]`? That will simplify the situation. 
20131103 15:44:00 0500  asked a question  SAT Solver From the documentation of Say, I need to solve (in a Boolean ring)
Regards. 
20131101 08:11:13 0500  received badge  ● Supporter (source) 
20131101 08:09:02 0500  marked best answer  SAT Solver output There is no Without the There seems not be any online documentation, but you can actually read it from the sage command line, if you type: You will read and 
20131101 08:09:02 0500  received badge  ● Scholar (source) 
20131031 20:21:06 0500  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 