|
| |
|
|
Konstrukce minimálních DNF reprezentací 2-intervalových funkcí.
Dubovský, Jakub ; Čepek, Ondřej (advisor) ; Kučera, Petr (referee)
Title: A construction of minimum DNF representations of 2-interval functions Author: Jakub Dubovský Department: Dep. of Theoretical Computer Science and Mathematical Logic Supervisor: doc.RNDr.Ondřej Čepek, Ph.D. Abstract: The thesis is devoted to interval boolean functions. It is focused on construction of their representation by disjunctive normal forms with minimum number of terms. Summary of known results in this field for 1-interval functions is presented. It shows that method used to prove those results cannot be in general used for two or more interval functions. It tries to extend those results to 2-interval functions. An optimization algorithm for special subclass of them is constructed. Exact error estimation for approximation algorithm is proven. A command line software for experimentation with interval function is part of the thesis. Keywords: boolean function, interval function, representation construction, ap- proximation 1
|
|
|
Classes of Boolean Formulae with effectively soluable SAT.
Vlček, Václav ; Čepek, Ondřej (advisor) ; Kučera, Petr (referee)
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 formulae). Furthermore the work studies recognition problems for a formula and a given class of functions, satisability testing, and mutual relations of the studied classes with respect to inclusion.
|
|
|
Properties of interval Boolean functions
Hušek, Radek ; Čepek, Ondřej (advisor) ; Kučera, Petr (referee)
Boolean function f is k-interval if - input vector viewed as n-bit number - f is true for and only for inputs from given (at most) k intervals. Recognition of k-interval fuction given its DNF representation is coNP-hard problem. This thesis shows that for DNFs from a given solvable class (class C of DNFs is solvable if we can for any DNF F ∈ C decide F ≡ 1 in polynomial time and C is closed under partial assignment) and fixed k we can decide whether F represents k-interval function in polynomial time. 1
|
|
| |
|
|
Time complexity of Boolean minimization.
Gurský, Štefan ; Čepek, Ondřej (advisor) ; Kučera, Petr (referee)
This thesis deals with the time complexity of Boolean minimization - minimization of formulae that represent Boolean functions. It presents basic concepts from the area of Boolean functions, of their normal form representations and of minimization of these representations. A whole chapter is dedicated to Umans's [13] proofs of 2 completeness of minimization of general DNF formulae for both common measures of minimality. For a class of formulae called Matched this thesis presents new results that show that although satisfiability problem is easy for Matched formulae (difficult for an arbitrary formula), problems connected to minimization and minimization itself is as hard for Matched formulae as it is for general formulae.
|
|
|
Properties of k-interval Boolean functions
Gál, Pavol ; Čepek, Ondřej (advisor) ; Kučera, Petr (referee)
The main focus of this thesis is on interval Boolean functions. The thesis presents some fundamental knowledge about Boolean functions, their representations and, in particular, concentrates on positive boolean functions. The thesis quotes several known results about interval functions, such as their various properties, some recognition algorithms and their complexity. Then the thesis introduces commutative Boolean functions and studies the properties of commutative positive Boolean functions and some derived forms. The thesis formulates several propositions about their structure and number of intervals. The most important and new result is the algorithm for recognition of positive 3-interval functions. Finally the thesis analyzes the structure and number of intervals of a few particular general Boolean functions.
|
|
|
Turkey's EU accession: Analysis of the Turkish attitude
Hlavatá, Nora ; Malečková, Jitka (advisor) ; Kučera, Petr (referee)
The subject of this thesis is Turkey's stance to joining the European Union in the year 2014. The first part of this text is a summarization of the relationship developments between Turkey and the EU, with special focus on those issues which could potentially play a significant role in current affaris. The second part of this thesis focuses on analysis of three examples of Turkish daily press, in order to demonstrate the different stances towards the issue of EU membership as raised in Turkish society. The second part is also divided into thematic segments which are relevant to Turkey's possible membership in the EU. The main goal of this thesis is to accurately present the various Turkish viewpoints and opinions, as they took place in 2014, about entry into the EU. Particular attention is also dedicated to Turkey's changing stance towards the issue in the year 2014, as opposed to previous years. Key words: European Union - Turkey - Accession Process - Public opinion
|
|
|
Czechoslovak-Turkish relations and the Image of Turkey in the journal Foreign Policy (1918-1938)
Lahučká, Karolína ; Malečková, Jitka (advisor) ; Kučera, Petr (referee)
This bachelor thesis is focused on development of Czechoslovak-Turkish relations in the inter-war period and the depiction of Turkey in the journal Foreign Policy, which was published by Ministry of Foreign Affaires of the Czechoslovak Republic between years 1920-1938. The first part of the thesis gives a summary of czechoslovak and turkish foreign policy. This chapter puts emphasis on events which had an influence on mutual relations and diplomatic representations. The second part of the thesis is an analysis of the view on Turkey in the journal Foreign Policy using methods of media analysis. The image of Turkey is divided into six blocks by their topic instead of chronological order. The analysis aims to show to what extent the view on Turkey and mutual relations was changed during the pursued period and to indicate whether the view was within the journal unanimous or not.
|
|
|
Plantation guild in Louny (1885-1948) as an example of development of the Czech civil class
Kučera, Petr ; Jakubec, Ivan (advisor) ; Rákosník, Jakub (referee)
This text deals with the history of one of many affinity groups originating in Louny in the second half of the 19th century - the Plantation Guild in Louny. The activity of the Plantation Guild in Louny (1885 - 1948) comprised setting of trees in the town streets and planting of parks in the neighbourhood of the town. Both the activity and the members of this guild are interesting. Till the beginning of the First World War there were many people, who had a considerable influence on the life in the town, in the guild. These people of middle class worked as lawyers, pharmacists, clerks, tradesmen etc. and despite their origin, they achieved participation on the political power and in such smaller towns as Louny these people gained all top positions in the corporation in the second half of the 19th century.
|
guest ::
