The Parameterized Complexity of Reasoning Problems


Project Acronym Projekt Kurzbezeichnung
Complex Reason
 
Project Title (de) Projekttitel (de)
The Parameterized Complexity of Reasoning Problems
 
Project Title (en) Projekttitel (en)
The Parameterized Complexity of Reasoning Problems
 
Consortium Coordinator Koordinator des Konsortiums
 
Principal Investigator Projektleiter_in
 
Funder/Funding Agency Fördergeber
Europäischer Forschungsrat (ERC)
Grant number Förderkennnummer
239962
 

Filter:
Subject:  Theoretical Computer Science

Results 1-9 of 9 (Search time: 0.002 seconds).

PreviewAuthor(s)TitleTypeIssue Date
1Ganian, Robert ; Hliněný, Petr ; Langer, Alexander ; Obdržálek, Jan ; Rossmanith, Peter ; Sikdar, Somnath Lower bounds on the complexity of MSO₁ model-checkingArtikel Article Feb-2014
2PICHLER, REINHARD ; RÜMMELE, STEFAN ; SZEIDER, STEFAN ; WOLTRAN, STEFAN Tractable answer-set programming with weight constraints: bounded treewidth is not enoughArtikel Article2014
3Ordyniak, Sebastian ; Paulusma, Daniel ; Szeider, Stefan Satisfiability of acyclic and almost acyclic CNF formulasArtikel Article 2013
4PICHLER, REINHARD ; RÜMMELE, STEFAN ; SZEIDER, STEFAN ; WOLTRAN, STEFAN Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not EnoughArtikel Article2012
5Gaspers, Serge ; Sorkin, Gregory B. A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in betweenArtikel Article2012
6Fellows, Michael R. ; Gaspers, Serge ; Rosamond, Frances A. Parameterizing by the Number of NumbersArtikel Article2012
7Szeider, Stefan Monadic Second Order Logic on Graphs with Local Cardinality ConstraintsArtikel Article2011
8Gutin, Gregory ; Kim, Eun Jung ; Szeider, Stefan ; Yeo, Anders A Probabilistic Approach to Problems Parameterized Above or Below Tight BoundsArtikel Article2011
9Broersma, Hajo ; Dantchev, Stefan S. ; Johnson, Matthew ; Szeider, Stefan Journal of Discrete Algorithms 8(2) - EditorialArtikel Article2010