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:  General Computer Science

Results 1-5 of 5 (Search time: 0.001 seconds).

PreviewAuthor(s)TitleTypeIssue Date
1Ordyniak, Sebastian ; Paulusma, Daniel ; Szeider, Stefan Satisfiability of acyclic and almost acyclic CNF formulasArtikel Article 2013
2Gaspers, Serge ; Kratsch, Dieter ; Liedloff, Mathieu On Independent Sets and Bicliques in GraphsArtikel Article2012
3Gutin, Gregory ; Kim, Eun Jung ; Soleimanfallah, Arezou ; Szeider, Stefan ; Yeo, Anders Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint ProgrammingArtikel Article2012
4Alon, Noga ; Gutin, Gregory ; Kim, Eun Jung ; Szeider, Stefan ; Yeo, Anders Solving MAX-r-SAT Above a Tight Lower BoundArtikel Article2011
5Szeider, Stefan Monadic Second Order Logic on Graphs with Local Cardinality ConstraintsArtikel Article2011