C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Computational Complexity of Discrete Problems (Dagstuhl Seminar 19121).
Anna Gál
Rahul Santhanam
Till Tantau
Published in:
Dagstuhl Reports (2019)
Keyphrases
</>
computational complexity
np complete
neural network
image segmentation
benchmark problems
difficult problems
computational geometry
multi objective
np hard
dynamic programming
computational cost
decision problems