Zobrazeno 1 - 10
of 42
pro vyhledávání: '"výpočetní složitost"'
Autor:
Dvořák, Martin
We consider the Minimum 0-Extension Problem for a given fixed undirected graph with positive weights. We study the computational com- plexity of the threshold decision variant with respect to properties of the fixed graph, in particular modularity an
Externí odkaz:
http://www.nusl.cz/ntk/nusl-438026
Autor:
Onduš, Daniel
The problem of extending partial representations for an interval graph asks, whether it is possible to extend a given representation of some vertices to a valid representation of the entire graph. In this thesis we extend the recent result of Klavík
Externí odkaz:
http://www.nusl.cz/ntk/nusl-447949
Autor:
Dvořák, Martin
We consider the Minimum 0-Extension Problem for a given fixed undirected graph with positive weights. We study the computational com- plexity of the threshold decision variant with respect to properties of the fixed graph, in particular modularity an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2186::321fb54a7209ba9c1a1dc393f48aa018
http://www.nusl.cz/ntk/nusl-438026
http://www.nusl.cz/ntk/nusl-438026
Autor:
Onduš, Daniel
The problem of extending partial representations for an interval graph asks, whether it is possible to extend a given representation of some vertices to a valid representation of the entire graph. In this thesis we extend the recent result of Klavík
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2186::8d8ea92bc5383bdca84c2cd37591c1c4
http://www.nusl.cz/ntk/nusl-447949
http://www.nusl.cz/ntk/nusl-447949
Autor:
Ajdarów, Michal, Kučera, Antonín
Publikováno v:
32nd International Conference on Concurrency Theory (CONCUR 2021)
We show that for every fixed degree k ≥ 3, the problem whether the termination/counter complexity of a given demonic VASS is O(n^k), Ω(n^k), and Θ(n^k) is coNP-complete, NP-complete, and DP-complete, respectively. We also classify the complexity
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8f7274c2c950bda83dd5b102057df709
Autor:
Naumenko, Mykhailo
This work focuses on the study of logic circuits. We investigated the basics of the theory of logic circuits following the textbook "Models of Computation" by John E. Savage and we used this knowledge to solve some of the examples and problems sugges
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2186::cf5dfed2aaf360fde277435c2fda3da9
http://www.nusl.cz/ntk/nusl-434648
http://www.nusl.cz/ntk/nusl-434648
Autor:
Novotná, Jana
Interval graphs, intersection graphs of segments on a real line (intervals), play a key role in the study of algorithms and special structural properties. Unit interval graphs, their proper subclass, where each interval has a unit length, has also be
Externí odkaz:
http://www.nusl.cz/ntk/nusl-405113
Autor:
Horáček, Jaroslav
First, basic aspects of interval analysis, roles of intervals and their applications are addressed. Then, various classes of interval matrices are described and their relations are depicted. This material forms a prelude to the unifying theme of the
Externí odkaz:
http://www.nusl.cz/ntk/nusl-408132
Autor:
Hora, Martin
A labeled embedding of a planar graph G is a pair (G, g) consisting of a planar drawing G of G and a function g assigning labels (colors) to the faces of G. We study the problem of Embedding Restriction Satisfiability (ERS) that investi- gates whethe
Externí odkaz:
http://www.nusl.cz/ntk/nusl-397633