Cover Image

Homogeneous Algebraic Complexity Theory and Algebraic Formulas

Fuente: arXiv

Saved in:

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

Similar Items

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

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)

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

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

Metric Multiview Geometry -- a Catalogue in Low Dimensions
by: Duff, Timothy, et al.
Published: (2024)

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

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

A note reviewing Turing's 1936
by: Cattabriga, Paola
Published: (2013)

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

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

The Bit Complexity of Dynamic Algebraic Formulas and their Determinants
by: Anand, Emile, et al.
Published: (2024)

Smale's 6th problem for generic masses
by: Jensen, Anders N., et al.
Published: (2023)

Commutative Algebra and Algebraic Geometry using OSCAR
by: Boehm, Janko, et al.
Published: (2024)

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

The Quadrifocal Variety
by: Oeding, Luke
Published: (2015)

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

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

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

Exact Non-Identity Check and Gate-Teleportation-Based Indistinguishability Obfuscation are NP-hard for Low-T-Depth Quantum Circuits
by: Nevin, Joshua
Published: (2025)

Seminormal Rings (following Thierry Coquand)
by: Lombardi, Henri, et al.
Published: (2023)

Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers
by: Hakoniemi, Tuomas, et al.
Published: (2024)

Complexity Classes Arising from Circuits over Finite Algebraic Structures
by: Kawałek, Piotr, et al.
Published: (2026)

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)

A Galois-Theoretic Complexity Measure for Solving Systems of Algebraic Equations
by: Duff, Timothy
Published: (2025)

A Formal Analysis of Algorithms for Matroids and Greedoids
by: Abdulaziz, Mohammad, et al.
Published: (2025)

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

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

Fast LDL factorization for dense and sparse symmetric matrices over an arbitrary field
by: Solomonik, Edgar
Published: (2025)

The ABCD of topological recursion
by: Andersen, Jorgen Ellegaard, et al.
Published: (2017)

Lower Bounds for CSP Hierarchies Through Ideal Reduction
by: Conneryd, Jonas, et al.
Published: (2025)

Quantum Sabotage Complexity
by: Cornelissen, Arjan, 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)