ACM Symposium on the Theory of Computing (STOC)

Generalized GM-MDS: Polynomial Codes Are Higher Order MDS.

广义GM-MDS:多项式码是高阶MDS。

2024

Memory Checking Requires Logarithmic Overhead.

内存检查需要对数级开销。

2024

An Efficient Quantum Parallel Repetition Theorem and Applications.

高效量子并行重复定理及其应用。

2024

Online Edge Coloring Is (Nearly) as Easy as Offline.

在线边着色几乎与离线一样简单。

2024

New Graph and Hypergraph Container Lemmas with Applications in Property Testing.

图和超图容器引理的新进展及其在属性测试中的应用。

2024

The Asymptotic Rank Conjecture and the Set Cover Conjecture Are Not Both True.

渐近秩猜想与集合覆盖猜想不可能同时为真。

2024

Batch Proofs Are Statistically Hiding.

批量证明在统计上是隐藏的。

2024

Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs.

二部图中分数匹配的近最优动态舍入。

2024

New Tools for Smoothed Analysis: Least Singular Value Bounds for Random Matrices with Dependent Entries.

平滑分析的新工具:依赖项随机矩阵的最小奇异值界。

2024

Learning the Coefficients: A Presentable Version of Border Complexity and Applications to Circuit Factoring.

学习系数:边界复杂度的可展示版本及其在电路分解中的应用

2024

会议信息

会议名称:

ACM Symposium on the Theory of Computing

会议评级

CCF: A

CORE: A*

THCPL: A

年度会议

Year: 2025

Place: Prague, Czech Republic

Date: June 23-27, 2025

Timeline:

Abstract Deadline: N/A

Deadline: 2024-11-04T19:59:59-05:00

Year: 2021

Place: Virtual

Date: June 21-25, 2021

Timeline:

Abstract Deadline: N/A

Deadline: 2020-11-06T11:59:59-05:00

Built withby Ivy Science
Copyright © 2020-2024
版权所有:南京青藤格致信息科技有限公司
隐私和监管政策
苏ICP备20040574号-1
ICP许可证: 苏B2-20220377