Proof complexity in algebraic systems and bounded depth Frege systems with modular counting-Reference-Cited by-同舟云学术

Proof complexity in algebraic systems and bounded depth Frege systems with modular counting

Published:1996-09 Issue:3 Volume:6 Page:256-298
ISSN:1016-3328
Container-title:Computational Complexity
language:en
Short-container-title:Comput Complexity

Author:

Buss S.,Impagliazzo R.,Krajíček J.,Pudlák P.,Razborov A. A.,Sgall J.

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01294258.pdf

Reference37 articles.

1. M. Ajtai, The complexity of the pigeonhole principle. InProceedings of the 29th IEEE Symposium on Foundations of Computer Science, 1988, 346–355.

2. M. Ajtai, Parity and the pigeonhole principle. InFeasible Mathematics, ed.S. R. Buss and P. J. Scott, Birkhäuser, 1990, 1–24.

3. M. Ajtai, The independence of the modulop counting principle. InProceedings of the 26th ACM STOC, 1994, 402–411.

4. P. Beame, S. Cook, J. Edmonds, R. Impagliazzo, and T. Pitassi, The relative complexity ofNP search problems. InProceedings of the 27th ACM STOC, 1995, 303–314.

5. P. Beame, R. Impagliazzo, J. Krajíček, T. Pitassi, and P. Pudlák, Lower bounds on Hilbert's Nullstellensatz and propositional proofs. InProceedings of the 35th IEEE FOCS, 1994, 794–806. Journal version to appear inProc. of the London Math. Soc.

Cited by 76 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. First-order reasoning and efficient semi-algebraic proofs;Annals of Pure and Applied Logic;2025-01

2. Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

3. Semialgebraic Proofs, IPS Lower Bounds, and the \(\boldsymbol{\tau}\)-Conjecture: Can a Natural Number be Negative?;SIAM Journal on Computing;2024-06-05

4. Simple Hard Instances for Low-Depth Algebraic Proofs;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10

5. Ideals, determinants, and straightening: proving and using lower bounds for polynomial ideals;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09