共 50 条
- [1] Why are Proof Complexity Lower Bounds Hard? [J]. 2019 IEEE 60TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2019), 2019, : 1305 - 1324
- [2] Lower bounds on proof length in axiomatic theories [J]. IN THE SCOPE OF LOGIC: METHODOLOGY & PHILOSOPHY OF SCIENCE, 2002, 315 : 17 - 26
- [3] LOWER BOUNDS ON DISSIPATION IN COMPOSITE SYSTEMS [J]. PHYSICAL REVIEW A, 1987, 35 (01): : 369 - 373
- [4] Lower Bounds: From Circuits to QBF Proof Systems [J]. ITCS'16: PROCEEDINGS OF THE 2016 ACM CONFERENCE ON INNOVATIONS IN THEORETICAL COMPUTER SCIENCE, 2016, : 249 - 260
- [8] Proof Complexity Lower Bounds from Algebraic Circuit Complexity [J]. 31ST CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC 2016), 2016, 50
- [9] Input distance and lower bounds for propositional resolution proof length [J]. THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, PROCEEDINGS, 2005, 3569 : 282 - 293
- [10] UPPER AND LOWER BOUNDS FOR NONLINEAR COMPOSITE BEHAVIOR [J]. MATERIALS SCIENCE AND ENGINEERING A-STRUCTURAL MATERIALS PROPERTIES MICROSTRUCTURE AND PROCESSING, 1994, 175 (1-2): : 7 - 14