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

View Statistics Email Alert RSS Feed

Primary Data

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
 

Grants

Funder/Funding Agency Fördergeber
European Commission
Grant number Förderkennnummer
101071674
 

Publications

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

PreviewAuthor(s)TitleTypeIssue Date
1Feller, Roman Maximilian ; Pinsker, Michael An Algebraic Proof of the Dichotomy for Graph Orientation Problems with Forbidden TournamentsArticle Artikel 2026
2Brunar, Johanna Beate A lope towards loops: temporal digraphsPresentation Vortrag8-Sep-2025
3Feller-2024-Graph orientation problems with forbidden tournaments-vor.pdf.jpgFeller, Roman Maximilian Graph orientation problems with forbidden tournamentsPresentation Vortrag 15-Oct-2024
4Feller-2024-A complexity dichotomy for graph orientation problems-vor.pdf.jpgFeller, Roman Maximilian A complexity dichotomy for graph orientation problemsPresentation Vortrag 31-Jul-2024
5Vucaj, Albert Clones over finite sets and Minor ConditionsPresentation Vortrag17-Oct-2023
6Vucaj, Albert Clones over finite sets up to minor-equivalencePresentation Vortrag7-Jul-2023