Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems

Type: Preprint

Publication Date: 2016-01-01

Citations: 0

DOI: https://doi.org/10.48550/arxiv.1605.05889

Locations

  • arXiv (Cornell University) - View - PDF
  • HAL (Le Centre pour la Communication Scientifique Directe) - View - PDF
  • DataCite API - View

Similar Works

Action Title Year Authors
+ Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems 2016 Jean‐Charles Faugère
Pierre-Jean Spaenlehauer
Jules Svartz
+ PDF Chat Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems 2016 Jean‐Charles Faugère
Pierre-Jean Spaenlehauer
Jules Svartz
+ PDF Chat Solving Polynomial Equations Over Finite Fields 2024 Holger Dell
Anselm Haak
Melvin Kallmayer
Leo Wennmann
+ PDF Chat A Crossbred Algorithm for Solving Boolean Polynomial Systems 2018 Antoine Joux
Vanessa Vitse
+ Algorithmic Thresholds for Refuting Random Polynomial Systems 2021 Jun-Ting Hsieh
Pravesh K. Kothari
+ PDF Chat A Sparse Version of Reznick’s Positivstellensatz 2022 Ngoc Hoang Anh
Victor Magron
Jean B. Lasserre
+ Review of: "A Number-Theoretic Proof of the Solvability of Polynomials" 2023 Alfredo Poirier
+ PDF Chat An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem 2024 Marco Aldi
Sevag Gharibian
Dorian Rudolph
+ Review of: "A Number-Theoretic Proof of the Solvability of Polynomials" 2023 K. N. Vidya
+ Review of: "A Number-Theoretic Proof of the Solvability of Polynomials" 2023 Neeraj Sangwan
+ Review of: "A Number-Theoretic Proof of the Solvability of Polynomials" 2023 Jiao Zhang
+ Tropical Combinatorial Nullstellensatz and Fewnomials Testing 2017 Dima Grigoriev
Vladimir V. Podolskii
+ Smale’s 17th problem: Average polynomial time to compute affine and projective solutions 2008 Carlos Beltrán
Luis Miguel Pardo
+ PDF Chat Constrained Multilinear Detection and Generalized Graph Motifs 2015 Andreas Björklund
Petteri Kaski
Łukasz Kowalik
+ PDF Chat Small solutions of polynomial congruences 2010 M. Ram Murty
+ Sparse polynomial systems 2011 Frank Sottile
+ On the Complexity of Solving a Bivariate Polynomial System 2011 Pavel Emeliyanenko
Michael Sagraloff
+ On the Complexity of Solving a Bivariate Polynomial System 2011 Pavel Emeliyanenko
Michael Sagraloff
+ PDF Chat Improved Algorithms for Solving Polynomial Systems over GF(2) by Multiple Parity-Counting 2021 Itai Dinur
+ PDF Chat An Introduction to T-Systems -- with a special Emphasis on Sparse Moment Problems, Sparse Positivstellens\"atze, and Sparse Nichtnegativstellens\"atze 2024 Philipp J. di Dio

Works That Cite This (0)

Action Title Year Authors

Works Cited by This (0)

Action Title Year Authors