Fine-Grained Completeness for Optimization in P

Bringmann, Karl; Cassis, Alejandro; Fischer, Nick; Künnemann, Marvin

doi:10.4230/LIPIcs.APPROX/RANDOM.2021.9

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

会議論文

Fine-Grained Completeness for Optimization in P

MPS-Authors

/persons/resource/persons44182

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

/persons/resource/persons263580

Cassis, Alejandro
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons242908

Fischer, Nick
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

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

フルテキスト (公開)

LIPIcs-APPROX9.pdf
(出版社版), 835KB

付随資料 (公開)

There is no public supplementary material available

引用

Bringmann, K., Cassis, A., Fischer, N., & Künnemann, M. (2021). Fine-Grained Completeness for Optimization in P. In M., Wootters, & L., Sanità (Eds.), Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (pp. 1-22). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.APPROX/RANDOM.2021.9.

引用: https://hdl.handle.net/21.11116/0000-0009-B411-8

要旨

要旨はありません