ON SOME FINE-GRAINED QUESTIONS IN ALGORITHMS AND COMPLEXITY
ON SOME FINE-GRAINED QUESTIONS IN ALGORITHMS AND COMPLEXITY
复制标题
关于算法和复杂性中的一些细粒度问题
DOI：
--
复制
发表时间：
2019
期刊：
影响因子：
--
通讯作者：
V. V. Williams
中科院分区：
文献类型：
--
作者：
V. V. Williams
近年来，基于“精细粒度减少”的“细粒度降低”的新“细粒度”理论，该理论的重点是模仿问题的精确运行时间。关键问题x对于某些功能t，猜想不可用任何O（t（n）1英寸）的时间算法来解决。因此给出了紧密的有条件时间下限对于他们来说，这种方法导致了问题之间的许多有意义的关系
In recent years, a new “fine-grained” theory of computational hardness has been developed, based on “fine-grained reductions” that focus on exact running times for problems. Mimicking NP-hardness, the approach is to (1) select a key problem X that for some function t , is conjectured to not be solvable by any O(t(n)1 ") time algorithm for " > 0, and (2) reduce X in a fine-grained way to many important problems, thus giving tight conditional time lower bounds for them. This approach has led to the discovery of many meaningful relationships between problems, and to equivalence
慢性乙型肝炎病毒 (HBV) 感染患者血清中 IFIT3 增加，并在体外通过 JAK-STAT2 促进干扰素α的抗 HBV 作用
影响因子：
3.7
作者：
Xu, Siyi;Huang, Jinlan;Xun, Zhen;Li, Shiqi;Fu, Ya;Lin, Ni;Wu, Wennan;Chen, Tianbin;Liu, Can;Ou, Qishui
通讯作者：
Ou, Qishui
稀疏图中最短循环和路径的严格硬度
DOI：
10.1137/1.9781611975031.91
发表时间：
2018
期刊：
Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms
影响因子：
--
作者：
Lincoln, A.;Vassilevska Williams, V.;Williams, R.
通讯作者：
Williams, R.