Fine-Grained Algorithms and Complexity

被引：2
|
作者：
Williams, Virginia Vassilevska [1 ]
机构：
[1] Stanford Univ, Stanford, CA 94305 USA
来源：
33RD SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2016) | 2016年 / 47卷
关键词：
fine-grained reductions; polynomial time problems; equivalence; hardness;
D O I：
10.4230/LIPIcs.STACS.2016.3
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页数：1
相关论文
共 50 条
  • [21] A note on the fine-grained complexity of MIS on regular graphs
    Akhoondian Amiri, Saeed
    Information Processing Letters, 2021, 170
  • [22] Fine-Grained Time Complexity of Constraint Satisfaction Problems
    Jonsson, Peter
    Lagerkvist, Victor
    Roy, Biman
    ACM TRANSACTIONS ON COMPUTATION THEORY, 2021, 13 (01)
  • [23] On the Fine-Grained Complexity of the Unbounded SubsetSum and the Frobenius Problem
    Klein, Kim-Manuel
    PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2022, : 3567 - 3582
  • [24] Towards a Fine-grained Analysis of Complexity of Programming Tasks
    Duran, Rodrigo
    PROCEEDINGS OF THE 2017 ACM CONFERENCE ON INTERNATIONAL COMPUTING EDUCATION RESEARCH (ICER 17), 2017, : 271 - 272
  • [25] Manipulating Districts to Win Elections: Fine-Grained Complexity
    Eiben, Eduard
    Fomin, Fedor, V
    Panolan, Fahad
    Simonov, Kirill
    THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 1902 - 1909
  • [26] Advice Complexity of Fine-Grained Job Shop Scheduling
    Wehner, David
    ALGORITHMS AND COMPLEXITY (CIAC 2015), 2015, 9079 : 416 - 428
  • [27] FINE-GRAINED COMPLEXITY OF COLORING UNIT DISKS AND BALLS
    Biro, Csaba
    Bonnet, Edouard
    Marx, Daniel
    Miltzow, Tillmann
    Rzazewski, Pawel
    JOURNAL OF COMPUTATIONAL GEOMETRY, 2018, 9 (02) : 47 - 80
  • [28] Scalable Fine-Grained Parallel Cycle Enumeration Algorithms
    Blanusa, Jovan
    Ienne, Paolo
    Atasu, Kubilay
    Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2022, : 247 - 258
  • [29] Fine-grained tournament selection operator in genetic algorithms
    Filipovic, V
    COMPUTING AND INFORMATICS, 2003, 22 (02) : 143 - 161
  • [30] Scalable Fine-Grained Parallel Cycle Enumeration Algorithms
    Blanusa, Jovan
    Ienne, Paolo
    Atasu, Kubilay
    PROCEEDINGS OF THE 34TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, SPAA 2022, 2022, : 247 - 258
12345