C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Computational Complexity of Discrete Problems (Dagstuhl Seminar 23111).
Anna Gál
Meena Mahajan
Rahul Santhanam
Till Tantau
Manaswi Paraashar
Published in:
Dagstuhl Reports (2023)
Keyphrases
</>
computational complexity
np complete
optimization problems
decision problems
benchmark problems
related problems
artificial neural networks
data sets
computer vision
decision making
expert systems
application domains
problems involving
solving problems
difficult problems
continuous domains