Cover Image

Fixed-parameter debordering of Waring rank

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Dutta, Pranjal, Gesmundo, Fulvio, Ikenmeyer, Christian, Jindal, Gorav, Lysikov, Vladimir
Format:	Preprint
Published:	2024
Subjects:	Computational Complexity Algebraic Geometry 68Q99 F.1.3
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Homogeneous Algebraic Complexity Theory and Algebraic Formulas
by: Dutta, Pranjal, et al.
Published: (2023)

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

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

Which graph motif parameters count?
by: Bläser, Markus, et al.
Published: (2025)

Recent Advances in Debordering Methods
by: Dutta, Pranjal, et al.
Published: (2025)

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

Functional Closure Properties of Finite $\mathbb{N}$-weighted Automata
by: Dörfler, Julian, et al.
Published: (2024)

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

Bernstein-Gelfand-Gelfand meets geometric complexity theory: resolving the 2 x 2 permanents of a 2 x n matrix
by: Gesmundo, Fulvio, et al.
Published: (2023)

Structure of sparse Boolean functions over Abelian groups, and its application to testing
by: Chakraborty, Sourav, et al.
Published: (2024)

Meta Theorem for Hardness on FCP-Problem
by: Nagao, Atsuki, et al.
Published: (2025)

Upper and Lower Bounds for the Linear Ordering Principle
by: Hirsch, Edward A., et al.
Published: (2025)

Linear Matroid Intersection is in Catalytic Logspace
by: Agarwala, Aryan, et al.
Published: (2025)

Oracle Separations for RPH
by: Hamm, Thekla, et al.
Published: (2025)

Sign-Rank of $k$-Hamming Distance is Constant
by: Göös, Mika, et al.
Published: (2025)

A Note on Avoid vs MCSP
by: Hirsch, Edward A., et al.
Published: (2025)

Diagonalization Without Relativization A Closer Look at the Baker-Gill-Solovay Theorem
by: Garcia, Baruch
Published: (2026)

Required-edge Cycle Cover Problem: an ASP-Completeness Framework for Graph Problems and Puzzles
by: Susukita, Kosuke, et al.
Published: (2026)

Border subrank of higher order tensors and algebras
by: Chang, Chia-Yu, et al.
Published: (2026)

On the Counting Complexity of the Skolem Problem
by: Jindal, Gorav, et al.
Published: (2024)

Shifted Partial Derivative Polynomial Rank and Codimension
by: Edwards, Darren J.
Published: (2025)

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

CLIQUE as an AND of Polynomial-Sized Monotone Constant-Depth Circuits
by: Bodnar, Levente
Published: (2024)

Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models
by: Kumar, Mrinal, et al.
Published: (2018)

Finitely (In)tractable Promise Constraint Satisfaction Problems
by: Asimi, Kristina, et al.
Published: (2020)

Explicit separations between randomized and deterministic Number-on-Forehead communication
by: Kelley, Zander, et al.
Published: (2023)

Formula Size-Depth Tradeoffs for Iterated Sub-Permutation Matrix Multiplication
by: Rossman, Benjamin
Published: (2024)

Leakage-Resilient Hardness Equivalence to Logspace Derandomization
by: Shalunov, Yakov
Published: (2023)

Generalisations of Matrix Partitions : Complexity and Obstructions
by: Barsukov, Alexey, et al.
Published: (2021)

Poincaré-Lelong type formulas and Segre numbers
by: Andersson, Mats
Published: (2023)

Quantum Sabotage Complexity
by: Cornelissen, Arjan, et al.
Published: (2024)

Stretching Demi-Bits and Nondeterministic-Secure Pseudorandomness
by: Tzameret, Iddo, et al.
Published: (2023)

On the computational complexity of Data Flow Analysis
by: Sood, Gaurav, et al.
Published: (2013)

The Serial Scaling Hypothesis
by: Liu, Yuxi, et al.
Published: (2025)

PosSLP and Sum of Squares
by: Bläser, Markus, et al.
Published: (2024)

Failure of the strong feasible disjunction property
by: Krajicek, Jan
Published: (2026)

Separation of PSPACE and EXP
by: Czerwinski, Reiner
Published: (2021)

Computing the Polytope Diameter is Even Harder than NP-hard (Already for Perfect Matchings)
by: Wulf, Lasse
Published: (2025)

Quantum algorithms through graph composition
by: Cornelissen, Arjan
Published: (2025)

Quantum walks through generalized graph composition
by: Cornelissen, Arjan
Published: (2025)