Cover Image

Recent Advances in Debordering Methods

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Dutta, Pranjal, Lysikov, Vladimir
Format:	Preprint
Published:	2025
Subjects:	Computational Complexity Symbolic Computation Algebraic Geometry 68Q17, 68Q15, 14L30
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Kronecker algorithm for locally closed sets over a perfect field
by: Giménez, Nardo, et al.
Published: (2025)

Sufficient conditions for the surjectivity of radical curve parametrizations
by: Caravantes, Jorce, et al.
Published: (2023)

Border subrank via a generalised Hilbert-Mumford criterion
by: Biaggi, Benjamin, et al.
Published: (2024)

Certified Real Eigenvalue Location
by: Solmaz, Baran, et al.
Published: (2026)

Integer multiplication is at least as hard as matrix transposition
by: Harvey, David, et al.
Published: (2025)

Certified simultaneous isotopic approximation of curves via subdivision
by: Burr, Michael, et al.
Published: (2023)

On some Exotic Cylindrical Algebraic Decompositions and Cells
by: Michel, Lucas
Published: (2026)

Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms
by: Ergür, Alperen A., et al.
Published: (2025)

Fixed-parameter debordering of Waring rank
by: Dutta, Pranjal, et al.
Published: (2024)

Complexity theory of orbit closure intersection for tensors: reductions, completeness, and graph isomorphism hardness
by: Lysikov, Vladimir, et al.
Published: (2024)

Border rank bounds for $GL(V)$-invariant tensors arising from matrices of constant rank
by: Wu, Derek
Published: (2024)

Algebraic metacomplexity and representation theory
by: Berg, Maxim van den, et al.
Published: (2024)

Beyond the Existential Theory of the Reals
by: Schaefer, Marcus, et al.
Published: (2022)

Exact values of generic subrank
by: Pielasa, Paweł, et al.
Published: (2024)

Computing Certificates of Strictly Positive Polynomials in Archimedean Quadratic Modules
by: Shang, Weifeng, et al.
Published: (2025)

The Separation of $NP$ and $PSPACE$
by: Lin, Tianrong
Published: (2021)

Polynomial Identity Testing via Evaluation of Rational Functions
by: Hu, Ivan, et al.
Published: (2022)

Symmetric subrank and its border analogue
by: Biaggi, Benjamin, et al.
Published: (2026)

A Geometric Approach to Cylindrical Algebraic Decomposition
by: Chen, Rizeng
Published: (2023)

Computing moment polytopes -- with a focus on tensors, entanglement and matrix multiplication
by: Berg, Maxim van den, et al.
Published: (2025)

Probabilistic Computers (So Quantum Computers) Are More Rigorously Powerful Than Traditional Computers, and Derandomization
by: Lin, Tianrong
Published: (2023)

Partial Degeneration of Tensors
by: Christandl, Matthias, et al.
Published: (2022)

Unifying lower bounds for algebraic machines, semantically
by: Seiller, Thomas, et al.
Published: (2018)

Toward P vs NP: An Observer-Theoretic Separation via SPDP Rank and a ZFC-Equivalent Foundation within the N-Frame Model
by: Edwards, Darren J.
Published: (2025)

Barriers for rectangular matrix multiplication
by: Christandl, Matthias, et al.
Published: (2020)

Cylindrical Algebraic Decomposition in Macaulay2
by: Lee, Corin, et al.
Published: (2025)

Vanishing of Schubert coefficients is in ${\sf AM}\cap {\sf coAM}$ assuming the GRH
by: Pak, Igor, et al.
Published: (2025)

Vanishing of Schubert coefficients in probabilistic polynomial time
by: Pak, Igor, et al.
Published: (2025)

Certified simultaneous isotopic approximation of curves via subdivision
by: Burr, Michael, et al.
Published: (2024)

Completeness classes in algebraic complexity theory
by: Bürgisser, Peter
Published: (2024)

Vanishing of Schubert Coefficients
by: Pak, Igor, et al.
Published: (2024)

A new method for reducing algebraic programs to polynomial programs
by: Maaz, Muhammad, et al.
Published: (2025)

Symmetrization maps and minimal border rank Comon's conjecture
by: Mańdziuk, Tomasz, et al.
Published: (2024)

A Study of NP-Completeness and Undecidable Word Problems in Semigroups
by: Abdullah, Duaa, et al.
Published: (2025)

On Projective Delineability
by: Michel, Lucas, et al.
Published: (2024)

Resolution of The Linear-Bounded Automata Question
by: Lin, Tianrong
Published: (2021)

Diagonalization of Polynomial-Time Deterministic Turing Machines via Nondeterministic Turing Machines
by: Lin, Tianrong
Published: (2021)

Geometric complexity theory for product-plus-power
by: Dutta, Pranjal, et al.
Published: (2022)

Concise tensors of minimal border rank
by: Jelisiejew, Joachim, et al.
Published: (2022)

Folding One Polyhedral Metric Graph into Another
by: Chung, Lily, et al.
Published: (2024)