• 学术搜索
  • 科研智能体
    • Research Labs
    • AI 阅读
    • AI 文库
    • 深度研究
    • 学者亮点
  • 学术资源
    • AI2000
    • 期刊/会议
    • 学者库
    • 学术API
      MCP&Skill
    • 溯源树
    • 数据集
  • 知识沉淀
    • 学术空间
订阅小程序
旧版功能
aminer vip
开通会员低至0.73元/天
一次搞定AI科研
立即登录
  • English
  • 联系方式
    Symposium on the Theory of Computing

    Symposium on the Theory of Computing

    ConferenceCCF 计算机科学理论 A

    年发文量

    研究主题

    论文(8842)

    排序
    1Fine-Grained Bounds for Courcelle's Theorem.
    Daniel Lokshtanov,Fahad Panolan,Saket Saurabh,Jie Xue,Meirav Zehavi

    Courcelle's theorem states that there exists an algorithm that takes as input a graph G of treewidth at most t and a MSO formula ϕ, and determines whether G satisfies ϕ in time f(ϕ,t) · n. It is folklore that the the function f contains a tower of exponentials whose height depends as a linear function of the number of quantifier alternations of the input formula ϕ. A classic reduction of Frick and Grohe shows that, assuming the Exponential Time Hypothesis (ETH), the linear growth of the height of the tower is unavoidable. Nevertheless, there is still a huge gap between existing upper and lower bounds – after all, there is quite a difference between a single exponential and a double exponential running time. In addition, this only gives us a very coarse understanding in the time complexity of Courcelle's theorem. In this paper, we prove a fine-grained version of Courcelle's theorem with nearly ETH-tight dependence on the treewidth parameter t and the quantifier structure of ϕ (specifically, the number of first order and second order variables in each quantifier alternation block).

    2026引用:1
    引用
    AI阅读
    加入学术空间
    2Secret-Key PIR from Random Linear Codes.
    Caicai Chen,Yuval Ishai,Tamer Mour,Alon Rosen
    2026引用:3
    引用
    AI阅读
    加入学术空间
    3Settling the Pass Complexity of Streaming Set Cover.
    Sepehr Assadi,Janani Sundaresan

    In the streaming set cover problem, m sets from a universe of size n are arriving one by one in a stream, and the algorithm is allowed to process the stream using one or a few passes and a space of o(mn), which is sublinear in the input size. The goal is to determine the minimal (or approximately minimal) number of sets that cover the universe at the end of the last pass. This problem has been studied extensively over the years with rapid progress that led to several O(logn)-approximation algorithms in Õ(mn^1/p) space and O(p) passes. However, progress on this front has largely stagnated over the past decade, despite the absence of any lower bounds that rule out even an O(logn)-approximation in O(m) space and just two passes. We provide a simple explanation for this lack of progress by establishing an optimal three-way space-pass-approximation tradeoff for this problem: any α-approximation algorithm for streaming set cover requires (m/α·(n/α)^1/p) space in p passes whenever α≪ n^1/(p+1). In light of prior work, this result is optimal up to constant factors in p and logarithmic factors in n,m for any α≥ p. Our bound is optimal with respect to the range of α also, and fully settles the complexity of this fundamental problem in the streaming model. The proof of this result is (surprisingly) simple and non-technical and relies on a randomized reduction from a variant of the standard pointer chasing problem in communication complexity, using elementary properties of random sets.

    2026
    引用
    AI阅读
    加入学术空间
    4Locally Computable High Independence Hashing.
    Yevgeniy Dodis,Shachar Lovett,Daniel Wichs
    2026
    引用
    AI阅读
    加入学术空间
    5Ideals, Macaulay Bases, and PCPs.
    Prashanth Amireddy, Amik Raj Behera,Srikanth Srinivasan,Madhu Sudan, Sophus Valentin Willumsgaard
    2026引用:1
    引用
    AI阅读
    加入学术空间
    立即登录,查看全部 8842 篇论文

    高被引作者

    作者引用发文
    Silvio Micali2860115
    Oded Goldreich27314163
    Shafi Goldwasser2571440
    Avi Wigderson24079101
    Lov K. Grover171963
    Leslie Valiant1580116
    Craig Gentry156738
    Moni Naor1390549
    Oded Regev1098422
    Moses Charikar1097431

    高产作者

    作者引用发文
    Oded Goldreich27314163
    Venkatesan Guruswami7901132
    Avi Wigderson24079101
    Shachar Lovett324595
    Ran Raz717477
    Marek Karpinski387375
    Emanuele “Manu” Viola197969
    Salil Vadhan884367
    Toniann Pitassi501765
    Madhu Sudan1071662

    相关期刊

    ACM Transactions on Algorithms
    Electronic Colloquium on Computational Complexity
    Journal of the ACM
    IEEE Annual Symposium on Foundations of Computer Science
    International Colloquium on Automata, Languages and Programming
    Information Technology and Computer Science
    SIAM Journal on Computing
    arXiv: Data Structures and Algorithms
    ACM-SIAM Symposium on Discrete Algorithms
    Foundations of Computer Science