Home > Search Results: Kaleyski, Nikolay Stoyanov
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 3 records found  Search took 0.00 seconds. 
Boolean methods in knowledge compilation
 Kaleyski, Nikolay Stoyanov ; Čepek, Ondřej (advisor) ; Gregor, Petr (referee)
The open problem in knowledge compilation of whether the language PI is at least as succinct as MODS is answered in the negative. For this purpose a class of Boolean functions with a number of prime implicants that is superpolynomial in their number of false points is constructed. A lower bound (proving that PI is not at least as succinct as MODS), an upper bound (proving that the counterexample cannot yield an exponential separation of PI and MODS) and the precise number of the prime implicants of these functions is computed. Powered by TCPDF (www.tcpdf.org)
Detailed record
Boolean methods in knowledge compilation
 Kaleyski, Nikolay Stoyanov ; Čepek, Ondřej (advisor) ; Gregor, Petr (referee)
The open problem in knowledge compilation of whether the language PI is at least as succinct as MODS is answered in the negative. For this purpose a class of Boolean functions with a number of prime implicants that is superpolynomial in their number of false points is constructed. A lower bound (proving that PI is not at least as succinct as MODS), an upper bound (proving that the counterexample cannot yield an exponential separation of PI and MODS) and the precise number of the prime implicants of these functions is computed. Powered by TCPDF (www.tcpdf.org)
Detailed record
Eigenvalues of symmetric interval matrices
 Kaleyski, Nikolay Stoyanov ; Hladík, Milan (advisor) ; Hartman, David (referee)
The goal of the thesis is to describe and possibly improve some algorithms for finding inner and outer approximations of the borders of eigenvalue intervals of real symmetric interval matrices, to modify them so that they perform verified computations and to implement them in the Matlab programming language. The main principles of verification and interval arithmetic are described, as well as the used theoretical foundations and the problems which occur when attempting to verify the individual algorithms, including possibilities of overcoming them. Experiments illustrating some empirical properties of the algorithms are described. The practical result of the thesis is a software package for computing approximations of the sets of eigenvalues of symmetric interval matrices. 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