Home > Search Results: Gaysin, Azza
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 2 records found  Search took 0.00 seconds. 
Proof Complexity of CSP
 Gaysin, Azza ; Krajíček, Jan (advisor) ; Kolokolova, Antonina (referee) ; Kompatscher, Michael (referee)
In this thesis we formalize Zhuk's decision algorithm solving in p-time tractable con- straint satisfaction problems (CSPs) in a weak theory of bounded arithmetic W1 1 . As a consequence, we show that tautologies that express the negative instances of such CSPs have polynomial proofs in the quantified propositional calculus G. 1
Detailed record
Weighted Clones
 Gaysin, Azza ; Barto, Libor (advisor) ; Příhoda, Pavel (referee)
Weighted clones Azza Gaysin January 3, 2018 Abstract In this thesis we fully describe the structure of all binary parts of weighted clones over the Boolean clones generated by one of the semilattice operations and one or two of the constant operations. We also give a complete description of all atomic and maximal weighted clones over these clones. Keywords: Relational clones, VCSP, Weighted clones 1
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