Finer-grained reductions in fine-grained hardness of approximation

Authors: Elie Abboud, Noga Ron-Zewi

Contributors: Elie Abboud and Noga Ron-Zewi

Source: Theoretical Computer Science. 1026:114976

Subject Terms: Computational Geometry (cs.CG), FOS: Computer and information sciences, fine-grained reduction, Fine-grained complexity, Computational and structural complexity theory, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, Approximation algorithms, Computational geometry, Computer Science - Computational Complexity, conditional lower bound, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Computer Science - Computational Geometry, Analysis of algorithms, Data Structures and Algorithms (cs.DS), ddc:004

File Description: application/pdf

Access URL: http://arxiv.org/abs/2311.00798
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.7

The Power of Self-Reducibility: Selectivity, Information, and Approximation

Authors: Hemaspaandra, Lane A.^Aff10

Contributors: Goos, Gerhard, Founding Editor^Aff1, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Editorial Board Member^Aff3, Gao, Wen, Editorial Board Member^Aff4, Steffen, Bernhard, Editorial Board Member^Aff5, Woeginger, Gerhard, Editorial Board Member^Aff6, Yung, Moti, Editorial Board Member^Aff7, Du, Ding-Zhu, editor^Aff8, Wang, Jie, editor^Aff9

Source: Complexity and Approximation : In Memory of Ker-I Ko. 12000:19-47

An unambiguous class possessing a complete set

Authors: Lange, Klaus-Jörn^Aff1

Contributors: Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, Reischuk, Rüdiger, editor, Morvan, Michel, editor

Source: STACS 97 : 14th Annual Symposium on Theoretical Aspects of Computer Science Lübeck, Germany February 27–March 1, 1997 Proceedings. 1200:339-350