Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational 
Geometry

Bringmann, Karl

doi:10.1007/978-3-030-80049-9_6

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational Geometry

MPS-Authors

/persons/resource/persons44182

Bringmann, Karl
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Bringmann, K. (2021). Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational Geometry. In L. De Mol, A. Weiermann, F. Manea, & D. Fernández-Duque (Eds.), Connecting with Computability (pp. 60-70). Berlin: Springer. doi:10.1007/978-3-030-80049-9_6.

Cite as: https://hdl.handle.net/21.11116/0000-0009-B428-F

Abstract

There is no abstract available