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 条
  • [1] Fine-Grained Complexity Theory
    Bringmann, Karl
    36TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2019), 2019,
  • [2] Fine-Grained Complexity for Sparse Graphs
    Agarwal, Udit
    Ramachandran, Vijaya
    STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2018, : 239 - 252
  • [3] The Fine-Grained Complexity of CFL Reachability
    Koutris, Paraschos
    Deep, Shaleen
    PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2023, 7 (POPL):
  • [4] Fine-Grained Complexity of Safety Verification
    Chini, Peter
    Meyer, Roland
    Saivasan, Prakash
    JOURNAL OF AUTOMATED REASONING, 2020, 64 (07) : 1419 - 1444
  • [5] Fine-Grained Complexity of Temporal Problems
    Dabrowski, Konrad K.
    Jonsson, Peter
    Ordyniak, Sebastian
    Osipov, George
    KR2020: PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2020, : 284 - 293
  • [6] Fine-Grained Complexity of Safety Verification
    Chini, Peter
    Meyer, Roland
    Saivasan, Prakash
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, TACAS 2018, PT II, 2018, 10806 : 20 - 37
  • [7] ON THE FINE-GRAINED COMPLEXITY OF RAINBOW COLORING
    Kowalik, Lukasz
    Lauri, Juho
    Socala, Arkadiusz
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2018, 32 (03) : 1672 - 1705
  • [8] Fine-Grained Complexity of Safety Verification
    Peter Chini
    Roland Meyer
    Prakash Saivasan
    Journal of Automated Reasoning, 2020, 64 : 1419 - 1444
  • [9] FINE-GRAINED PARALLEL GENETIC ALGORITHMS
    MANDERICK, B
    SPIESSENS, P
    PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE ON GENETIC ALGORITHMS, 1989, : 428 - 433
  • [10] FINE-GRAINED COMPLEXITY OF REGULAR PATH QUERIES
    Casel, Katrin
    Schmid, Markus l.
    LOGICAL METHODS IN COMPUTER SCIENCE, 2023, 19 (04)
12345