The Parameterized Complexity of Reasoning Problems

View Statistics Email Alert RSS Feed

Primary Data

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
 

Grants

Funder/Funding Agency Fördergeber
Europäischer Forschungsrat (ERC)
Grant number Förderkennnummer
239962
 

Publications

Filter:
Subject:  Theoretical Computer Science
Author:  SZEIDER, STEFAN

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

PreviewAuthor(s)TitleTypeIssue Date
1PICHLER, REINHARD ; RÜMMELE, STEFAN ; SZEIDER, STEFAN ; WOLTRAN, STEFAN Tractable answer-set programming with weight constraints: bounded treewidth is not enoughArtikel Article2014
2Ordyniak, Sebastian ; Paulusma, Daniel ; Szeider, Stefan Satisfiability of acyclic and almost acyclic CNF formulasArtikel Article 2013
3PICHLER, REINHARD ; RÜMMELE, STEFAN ; SZEIDER, STEFAN ; WOLTRAN, STEFAN Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not EnoughArtikel Article2012
4Szeider, Stefan Monadic Second Order Logic on Graphs with Local Cardinality ConstraintsArtikel Article2011
5Gutin, Gregory ; Kim, Eun Jung ; Szeider, Stefan ; Yeo, Anders A Probabilistic Approach to Problems Parameterized Above or Below Tight BoundsArtikel Article2011
6Broersma, Hajo ; Dantchev, Stefan S. ; Johnson, Matthew ; Szeider, Stefan Journal of Discrete Algorithms 8(2) - EditorialArtikel Article2010