Results 171 to 180 of about 23,779 (205)
Some of the next articles are maybe not open access.

Related searches:

The Parameterized Complexity of Abduction

Proceedings of the AAAI Conference on Artificial Intelligence, 2021
Abduction belongs to the most fundamental reasoning methods. It is a method for reverse inference, this means one is interested in explaining observed behavior by finding appropriate causes. We study logic-based abduction, where knowledge is represented by propositional formulas.
Michael R. Fellows   +3 more
openaire   +1 more source

On parameterized exponential time complexity

open access: yesTheoretical Computer Science, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jianer Chen, Iyad A Kanj, Ge Xia
exaly   +2 more sources

Parameterized Random Complexity

Theory of Computing Systems, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Juan Andrés Montoya, Moritz Müller
openaire   +1 more source

The Parameterized Complexity of Stabbing Rectangles

Algorithmica, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael Dom   +3 more
openaire   +2 more sources

The parameterized complexity of counting problems

The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jörg Flum, Martin Grohe
openaire   +1 more source

Home - About - Disclaimer - Privacy