[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
article

Lower bounds for the polynomial calculus

Published: 02 December 1998 Publication History

Abstract

No abstract available.

Cited By

View all
  • (2024)A Generalized Method for Proving Polynomial Calculus Degree Lower BoundsJournal of the ACM10.1145/367566871:6(1-43)Online publication date: 4-Jul-2024
  • (2024)Black-Box PPP Is Not Turing-ClosedProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649769(1405-1414)Online publication date: 10-Jun-2024
  • (2023)On the Algebraic Proof Complexity of Tensor IsomorphismProceedings of the conference on Proceedings of the 38th Computational Complexity Conference10.4230/LIPIcs.CCC.2023.4(1-40)Online publication date: 17-Jul-2023
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Computational Complexity
Computational Complexity  Volume 7, Issue 4
Dec. 1998
97 pages
ISSN:1016-3328
Issue’s Table of Contents

Publisher

Birkhauser Verlag

Switzerland

Publication History

Published: 02 December 1998

Author Tags

  1. pigeonhole principle
  2. polynomial calculus
  3. proof complexity

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 10 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2024)A Generalized Method for Proving Polynomial Calculus Degree Lower BoundsJournal of the ACM10.1145/367566871:6(1-43)Online publication date: 4-Jul-2024
  • (2024)Black-Box PPP Is Not Turing-ClosedProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649769(1405-1414)Online publication date: 10-Jun-2024
  • (2023)On the Algebraic Proof Complexity of Tensor IsomorphismProceedings of the conference on Proceedings of the 38th Computational Complexity Conference10.4230/LIPIcs.CCC.2023.4(1-40)Online publication date: 17-Jul-2023
  • (2023)Sum-of-Squares Lower Bounds for the Minimum Circuit Size ProblemProceedings of the conference on Proceedings of the 38th Computational Complexity Conference10.4230/LIPIcs.CCC.2023.31(1-21)Online publication date: 17-Jul-2023
  • (2022)Ideals, determinants, and straightening: proving and using lower bounds for polynomial idealsProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3519935.3520025(389-402)Online publication date: 9-Jun-2022
  • (2022)On Proof Complexity of Resolution over Polynomial CalculusACM Transactions on Computational Logic10.1145/350670223:3(1-24)Online publication date: 22-Jul-2022
  • (2021)A lower bound for polynomial calculus with extension ruleProceedings of the 36th Computational Complexity Conference10.4230/LIPIcs.CCC.2021.21Online publication date: 20-Jul-2021
  • (2021)Computational and Proof Complexity of Partial String AvoidabilityACM Transactions on Computation Theory10.1145/344236513:1(1-25)Online publication date: 21-Jan-2021
  • (2021)Automating algebraic proof systems is NP-hardProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing10.1145/3406325.3451080(209-222)Online publication date: 15-Jun-2021
  • (2020)Exponential resolution lower bounds for weak pigeonhole principle and perfect matching formulas over sparse graphsProceedings of the 35th Computational Complexity Conference10.4230/LIPIcs.CCC.2020.28(1-24)Online publication date: 28-Jul-2020
  • Show More Cited By

View Options

View options

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media