Home > Search Results: Kullmann, Oliver
Search:
 
Search Tips :: Simple Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 1 records found  Search took 0.00 seconds. 
Classes of Boolean Formulae with Effectively Solvable SAT
 Vlček, Václav ; Čepek, Ondřej (advisor) ; Kullmann, Oliver (referee) ; Savický, Petr (referee)
The thesis studies classes of Boolean formulae for which the well-known satisfiability problem is solvable in polynomially bounded time. It focusses on classes based on unit resolution; it describe classes of unit refutation complete formulae, unit propagation complete formulae and focuses on the class of SLUR formulae. It presents properties of SLUR formulae as well as the recently obtained results. The main result is the coNP-completness of membership testing. Finally, several hierarchies are built over the SLUR class and their properties and mutual relations are studied. Powered by TCPDF (www.tcpdf.org)
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English