A SURPRISING RELATIONSHIP BETWEEN DESCRIPTIVE COMPLEXITY AND PROOF COMPLEXITY

被引:0
|
作者
Chen, Yijia [1 ]
Flum, Joerg [2 ]
Mueller, Moritz [3 ]
机构
[1] Shanghai Jiao Tong Univ, Dept Comp Sci, Shanghai, Peoples R China
[2] Albert Ludwigs Univ Freiburg Br, Math Inst, Freiburg, Germany
[3] Univ Passau, Fak Informat & Math, Passau, Germany
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:145 / 152
页数:8
相关论文
共 50 条
  • [31] Circuit Complexity, Proof Complexity, and Polynomial Identity Testing: The Ideal Proof System
    Grochow, Joshua A.
    Pitassi, Toniann
    JOURNAL OF THE ACM, 2018, 65 (06)
  • [32] Circuit Complexity, Proof Complexity and Polynomial Identity Testing
    Grochow, Joshua A.
    Pitassi, Toniann
    2014 55TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2014), 2014, : 110 - 119
  • [33] An experimental investigation on the relationship between perceived assembly complexity and product design complexity
    Bugra Alkan
    International Journal on Interactive Design and Manufacturing (IJIDeM), 2019, 13 : 1145 - 1157
  • [34] An experimental investigation on the relationship between perceived assembly complexity and product design complexity
    Alkan, Bugra
    INTERNATIONAL JOURNAL OF INTERACTIVE DESIGN AND MANUFACTURING - IJIDEM, 2019, 13 (03): : 1145 - 1157
  • [35] The descriptive complexity approach to LOGCFL
    Lautemann, C
    McKenzie, P
    Schwentick, T
    Vollmer, H
    STACS'99 - 16TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1999, 1563 : 444 - 454
  • [36] Descriptive complexity of controllable graphs
    Abiad, Aida
    Dawar, Anuj
    Zapata, Octavio
    Procedia Computer Science, 2023, 223 : 20 - 27
  • [37] The Descriptive Complexity of Parity Games
    Dawar, Anuj
    Graedel, Erich
    COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2008, 5213 : 354 - +
  • [38] On the descriptive complexity of Salem sets
    Marcone, Alberto
    Valenti, Manlio
    FUNDAMENTA MATHEMATICAE, 2022, 257 (01) : 69 - 94
  • [39] The descriptive complexity approach to LOGCFL
    Lautemann, C
    McKenzie, P
    Schwentick, T
    Vollmer, H
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2001, 62 (04) : 629 - 652
  • [40] The descriptive complexity of stochastic integration
    Mukeru, Safari
    JOURNAL OF COMPLEXITY, 2015, 31 (01) : 57 - 74