Berechnung in Polynomialzeit: Öffnen der Blackboxes für Bedingungserfüllungsprobleme


Project Acronym Projekt Kurzbezeichnung
POCOCOP
 
Project Title (de) Projekttitel (de)
Berechnung in Polynomialzeit: Öffnen der Blackboxes für Bedingungserfüllungsprobleme
 
Project Title (en) Projekttitel (en)
Polynomial-time Computation: Opening the Blackboxes in Constraint Problems
 
Consortium Coordinator Koordinator des Konsortiums
 
Principal Investigator Projektleiter_in
 
Funder/Funding Agency Fördergeber
European Commission
Grant number Förderkennnummer
101071674
 

Publications

Results 1-8 of 8 (Search time: 0.003 seconds).

PreviewAuthor(s)TitleTypeIssue Date
1Genciova-2026-A Preservation Theorem for Valued Structures-vor.pdf.jpgGenčiová, Žaneta ; Mottet, A. A Preservation Theorem for Valued StructuresPresentation Vortrag 14-Apr-2026
2Semanisinova-2026-A Preservation Theorem for Valued Structures-vor.pdf.jpgSemanišinová, Žaneta ; Bodirsky, M. ; Jahel, C. ; Mottet, A. A Preservation Theorem for Valued StructuresPresentation Vortrag 6-Feb-2026
3Feller, Roman Maximilian ; Pinsker, Michael An Algebraic Proof of the Dichotomy for Graph Orientation Problems with Forbidden TournamentsArticle Artikel 2026
4Brunar, Johanna Beate A lope towards loops: temporal digraphsPresentation Vortrag8-Sep-2025
5Feller-2024-Graph orientation problems with forbidden tournaments-vor.pdf.jpgFeller, Roman Maximilian Graph orientation problems with forbidden tournamentsPresentation Vortrag 15-Oct-2024
6Feller-2024-A complexity dichotomy for graph orientation problems-vor.pdf.jpgFeller, Roman Maximilian A complexity dichotomy for graph orientation problemsPresentation Vortrag 31-Jul-2024
7Vucaj, Albert Clones over finite sets and Minor ConditionsPresentation Vortrag17-Oct-2023
8Vucaj, Albert Clones over finite sets up to minor-equivalencePresentation Vortrag7-Jul-2023