Lower Bounds for Symmetric Circuits for the Determinant

被引：0
|
作者：
Dawar, Anuj [1 ]
Wilsenach, Gregory [1 ]
机构：
[1] Department of Computer Science and Technology, University of Cambridge, United Kingdom
来源：
Leibniz International Proceedings in Informatics, LIPIcs | 2022年 / 215卷
关键词：
Compilation and indexing terms; Copyright 2024 Elsevier Inc;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Matrix algebra - Logic circuits - Machinery - Computation theory - Economic and social effects
引用
收藏
相关论文
共 9 条
  • [1] New Algorithms and Lower Bounds for Streaming Tournaments
    Ghosh, Prantar
    Kuchlous, Sahil
    Leibniz International Proceedings in Informatics, LIPIcs, 308
  • [2] UPPER AND LOWER BOUNDS FOR LIMIT LOADS OF THICK AXISYMMETRIC PLATES
    Kuwamura, Hitoshi
    Journal of Structural and Construction Engineering, 2023, 88 (805): : 447 - 456
  • [3] Local Upper and Lower Bounds for a Class of Constrained Optimal Control Problems
    Liu, Vincent
    Dower, Peter M.
    Manzie, Chris
    IFAC-PapersOnLine, 58 (17): : 256 - 261
  • [4] Tight complexity lower bounds for integer linear programming with few constraints
    Knop, Dušan
    Pilipczuk, Michal
    Wrochna, Marcin
    Leibniz International Proceedings in Informatics, LIPIcs, 2019, 126
  • [5] Lower bounds on information complexity via zero-communication protocols and applications
    CNRS, LIAFA, Université Paris 7, France
    不详
    不详
    不详
    Proc. Annu. IEEE Symp. Found. Comput. Sci. FOCS, (500-509):
  • [6] Separable Convex Mixed-Integer Optimization: Improved Algorithms and Lower Bounds
    Brand, Cornelius
    Koutecký, Martin
    Lassota, Alexandra
    Ordyniak, Sebastian
    Leibniz International Proceedings in Informatics, LIPIcs, 2024, 308
  • [7] Explicit Lower Bounds Against O(n)-Rounds of Sum-of-Squares
    Hopkins, Max
    Lin, Ting-Chun
    Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, 2022, 2022-October : 662 - 673
  • [8] Fine-grained I/O complexity via reductions: new lower bounds, faster algorithms, and a time hierarchy
    Computer Science and Artificial Intelligence Lab, Massachusetts Institute of Technology, Cambridge
    MA, United States
    Leibniz Int. Proc. Informatics, LIPIcs,
  • [9] Single-pass Streaming Lower Bounds for Multi-armed Bandits Exploration with Instance-sensitive Sample Complexity
    Assadi, Sepehr
    Wang, Chen
    Advances in Neural Information Processing Systems, 2022, 35
1