Výsledky vyhledávání - "parameterized complexity theory"

Parameterized Counting of Partially Injective Homomorphisms Autor Roth, Marc

“…We study the parameterized complexity of the problem of counting graph homomorphisms with given partial injectivity constraints, i.e., inequalities between…”
Získat plný text

A multiparametric view on answer set programming Autor Fichte, Johannes K., Kronegger, Martin, Woltran, Stefan

“…Disjunctive answer set programming (ASP) is an important framework for declarative modeling and problem solving, where the computational complexity of basic…”
Získat plný text

Bridging the gap between theory and practice of approximate Bayesian inference Autor Kwisthout, Johan, van Rooij, Iris

“…In computational cognitive science, many cognitive processes seem to be successfully modeled as Bayesian computations. Yet, many such Bayesian computations…”
Získat plný text

Parameterized Random Complexity Autor Montoya, Juan Andrés, Müller, Moritz

“…The classes W[P] and W[1] are parameterized analogues of NP in that they can be characterized by machines with restricted existential nondeterminism. These…”
Získat plný text

Parameterized complexity of basic decision problems for tree automata Autor Charatonik, Witold, Chorowska, Agata

“…There are many decision problems in automata theory (including membership, emptiness, inclusion and universality problems) that are NP-hard for some classes of…”
Získat plný text

Lower Bounds for Existential Pebble Games and k-Consistency Tests Autor Berkholz, Christoph

“…The existential k-pebble game characterizes the expressive power of the existential-positive k-variable fragment of first-order logic on finite structures. The…”
Získat plný text

Bounded fixed-parameter tractability and reducibility Autor Downey, Rod, Flum, Jörg, Grohe, Martin, Weyer, Mark

“…We study a refined framework of parameterized complexity theory where the parameter dependence of fixed-parameter tractable algorithms is not arbitrary, but…”
Získat plný text

Model-Checking Problems as a Basis for Parameterized Intractability Autor Flum, Joerg, Grohe, Martin

“…Most parameterized complexity classes are defined in terms of a parameterized version of the Boolean satisfiability problem (the so-called weighted…”
Získat plný text