Třídy Booleovských formulí s efektivně řešitelným SATem.
This work studies classes of Boolean formulae with polynomially solvable satsiability problem (SAT). It investigates the behavior of these classes with respect to basic operation with formulae (variable and literal complementation, deletition of a literal or a clause, partial assignment and joining...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Dissertation |
| Language: | Czech |
| Published: |
2009
|
| Online Access: | http://www.nusl.cz/ntk/nusl-286191 |