Record link: 
http://hdl.handle.net/20.500.12708/210541
-
Title: 
On the computational complexity of unfriendly partitions
en
Citation: 
Cipriani, V. (2024, July 18). On the computational complexity of unfriendly partitions [Conference Presentation]. computability and complexity in analysis 2024, Swansea, United Kingdom of Great Britain and Northern Ireland (the). http://hdl.handle.net/20.500.12708/210541
-
Publication Type: 
Presentation - Conference Presentation
en
Language: 
English
-
Authors: 
Cipriani, Vittorio 
-
Organisational Unit: 
E104-02 - Forschungsbereich Computational Logic 
-
Date (published): 
18-Jul-2024
-
Event name: 
computability and complexity in analysis 2024 
en
Event date: 
15-Jul-2024 - 18-Jul-2024
-
Event place: 
Swansea, United Kingdom of Great Britain and Northern Ireland (the)
-
Keywords: 
Weihrauch reducibility; Unfriendly parititions of graphs; Computability theory
en
Project title: 
Strukturen durch Lernen Klassifizieren: P 36781-N (FWF - Österr. Wissenschaftsfonds) 
-
Research Areas: 
Mathematical and Algorithmic Foundations: 100%
-
Science Branch: 
1020 - Informatik: 5%
1010 - Mathematik: 95%
-
Appears in Collections:
Presentation

Show full item record

Page view(s)

23
checked on Feb 4, 2025

Google ScholarTM

Check