"
Team:MoWestern Davidson/project mathmodel
From 2009.igem.org
(Difference between revisions)
(New page: {{Template:MoWestern_Davidson2009}} ====Lego Models==== ====B2 Bomber==== ====Rough and Fine distribution==== {{Template:MoWestern_Davidson2009_end}}) |
(→Rough and Fine distribution) |
||
| Line 3: | Line 3: | ||
====B2 Bomber==== | ====B2 Bomber==== | ||
====Rough and Fine distribution==== | ====Rough and Fine distribution==== | ||
| - | + | SAT problems (satisfiability problems) are logic decision problems that ask if a combination of true-false variables (inputs) can be assigned to make the expression true. Here, we are using 3 variables: a, b, and c. For each variable there are 2 literals, either primed (a’) or unprimed (a). | |
{{Template:MoWestern_Davidson2009_end}} | {{Template:MoWestern_Davidson2009_end}} | ||
Revision as of 15:19, 27 July 2009
Lego Models
B2 Bomber
Rough and Fine distribution
SAT problems (satisfiability problems) are logic decision problems that ask if a combination of true-false variables (inputs) can be assigned to make the expression true. Here, we are using 3 variables: a, b, and c. For each variable there are 2 literals, either primed (a’) or unprimed (a).
