Cover Image

A parametric version of the Hilbert Nullstellensatz

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Manssour, Rida Ait El, Balaji, Nikhil, Nosan, Klara, Shirmohammadi, Mahsa, Worrell, James
Format:	Preprint
Published:	2024
Subjects:	Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Identity Testing for Radical Expressions
by: Balaji, Nikhil, et al.
Published: (2022)

Determination Problems for Orbit Closures and Matrix Groups
by: Manssour, Rida Ait El, et al.
Published: (2024)

On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices
by: Nosan, Klara, et al.
Published: (2021)

Simple Linear Loops: Algebraic Invariants and Applications
by: Manssour, Rida Ait El, et al.
Published: (2024)

Algebraic Closure of Matrix Sets Recognized by 1-VASS
by: Manssour, Rida Ait El, et al.
Published: (2025)

Differential Tree Automata
by: Manssour, Rida Ait El, et al.
Published: (2024)

Hilbert's Nullstellensatz is in the Counting Hierarchy
by: Andrews, Robert, et al.
Published: (2026)

Wronskians form the inverse system of the arcs of a double point
by: Manssour, Rida Ait El, et al.
Published: (2024)

Multiplicity structure of the arc space of a fat point
by: Manssour, Rida Ait El, et al.
Published: (2021)

On the Complexity of the Optimal Correlated Equilibria in Extensive-Form Games
by: Cheval, Vincent, et al.
Published: (2025)

Problems from Optimization and Computational Algebra Equivalent to Hilbert's Nullstellensatz
by: Bläser, Markus, et al.
Published: (2025)

On the Complexity of the Skolem Problem at Low Orders
by: Bacik, Piotr, et al.
Published: (2025)

Positivity of Nearly Linearly Recurrent Sequences
by: Pouly, Amaury, et al.
Published: (2025)

Combinatorial Differential Algebra of $x^p$
by: Manssour, Rida Ait El, et al.
Published: (2021)

Geometry Of The Subset Sum Problem -- Part I
by: Bollepalli, Srinivas Balaji
Published: (2025)

Reachability for Multi-Priced Timed Automata with Positive and Negative Rates
by: Scoones, Andrew, et al.
Published: (2024)

One-way Communication Complexity of Minimum Vertex Cover in General Graphs
by: Derakhshan, Mahsa, et al.
Published: (2025)

Query Complexity with Unknowns
by: Mande, Nikhil S., et al.
Published: (2024)

Hilbert Functions and Low-Degree Randomness Extractors
by: Golovnev, Alexander, et al.
Published: (2024)

A Strong Version of the Hilbert Nullstellensatz for slice regular polynomials in several quaternionic variables
by: Gori, Anna, et al.
Published: (2024)

Extended Nullstellensatz proof systems
by: Krajicek, Jan
Published: (2023)

D-Algebraic Functions
by: Manssour, Rida Ait El, et al.
Published: (2023)

Real Lines on Random Cubic Surfaces
by: Manssour, Rida Ait El, et al.
Published: (2019)

Quasi-Linear Size PCPs with Small Soundness from HDX
by: Bafna, Mitali, et al.
Published: (2024)

Reductions Between Code Equivalence Problems
by: Cheraghchi, Mahdi, et al.
Published: (2025)

Instance complexity of Boolean functions
by: Liu, Alison Hsiang-Hsuan, et al.
Published: (2023)

Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz
by: Conneryd, Jonas, et al.
Published: (2025)

Lower bounds for quantum-inspired classical algorithms via communication complexity
by: Mande, Nikhil S., et al.
Published: (2024)

Tight Bounds for Quantum Phase Estimation and Related Problems
by: Mande, Nikhil S., et al.
Published: (2023)

Sensitivity and Query Complexity under Uncertainty
by: Benson, Deepu, et al.
Published: (2025)

A simplified version of the quantum OTOC$^{(2)}$ problem
by: King, Robbie, et al.
Published: (2025)

Improved Quantum Query Upper Bounds Based on Classical Decision Trees
by: Cornelissen, Arjan, et al.
Published: (2022)

Recursion and proof theoretical characterizations of small circuit classes with modulo counting via discrete differential equations (long version)
by: Antonelli, Melissa, et al.
Published: (2026)

The status of the quantum PCP conjecture (games version)
by: Natarajan, Anand, et al.
Published: (2024)

Hardness of Finding Kings and Strong Kings
by: Alaoui, Ziad Ismaili, et al.
Published: (2025)

On the Exact Matching Problem in Dense Graphs
by: Maalouly, Nicolas El, et al.
Published: (2024)

Optimal Sensor and Actuator Selection for Factored Markov Decision Processes: Complexity, Approximability and Algorithms
by: Bhargav, Jayanth, et al.
Published: (2024)

On the communication complexity of finding a king in a tournament
by: Mande, Nikhil S., et al.
Published: (2024)

Quantum Search With Generalized Wildcards
by: Cornelissen, Arjan, et al.
Published: (2025)

Planar Coulomb gas on a Jordan arc at any temperature
by: Courteaut, Klara, et al.
Published: (2025)