Imagen de Portada

Closure under factorization from a result of Furstenberg

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bhattacharjee, Somnath, Kumar, Mrinal, Rai, Shanthanu S., Ramanathan, Varun, Saptharishi, Ramprasad, Saraf, Shubhangi
Formato:	Preprint
Publicado:	2025
Materias:	Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Constant-depth circuits for polynomial GCD over any characteristic
por: Bhattacharjee, Somnath, et al.
Publicado: (2025)

Deterministic factorization of constant-depth algebraic circuits in subexponential time
por: Bhattacharjee, Somnath, et al.
Publicado: (2025)

Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits
por: Kumar, Mrinal, et al.
Publicado: (2024)

Modular composition & polynomial GCD in the border of small, shallow circuits
por: Andrews, Robert, et al.
Publicado: (2025)

If VNP is hard, then so are equations for it
por: Kumar, Mrinal, et al.
Publicado: (2020)

On the Existence of Algebraic Natural Proofs
por: Chatterjee, Prerona, et al.
Publicado: (2020)

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

An exposition of recent list-size bounds of FRS Codes
por: Garg, Abhibhav, et al.
Publicado: (2025)

Pseudo-Deterministic Construction of Irreducible Polynomials over Finite Fields
por: Rai, Shanthanu S
Publicado: (2024)

Lower Bounds for Set-Multilinear Branching Programs
por: Chatterjee, Prerona, et al.
Publicado: (2023)

Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes
por: Kopparty, Swastik, et al.
Publicado: (2023)

Exponential lower bound via exponential sums
por: Bhattacharjee, Somnath, et al.
Publicado: (2026)

Advances in List Decoding of Polynomial Codes
por: Kumar, Mrinal, et al.
Publicado: (2026)

Deterministic list decoding of Reed-Solomon codes
por: Chatterjee, Soham, et al.
Publicado: (2025)

High Rate Multivariate Polynomial Evaluation Codes
por: Kopparty, Swastik, et al.
Publicado: (2024)

On hardness of computing analytic Brouwer degree
por: Chakraborty, Somnath
Publicado: (2023)

Fast list recovery of univariate multiplicity and folded Reed-Solomon codes
por: Goyal, Rohan, et al.
Publicado: (2025)

Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes
por: Goyal, Rohan, et al.
Publicado: (2023)

Closure Properties and Characterizations of TotP
por: Ivanashev, Yaroslav
Publicado: (2025)

New Bounds for the Ideal Proof System in Positive Characteristic
por: Behera, Amik Raj, et al.
Publicado: (2025)

Low Sets and Closure Properties of Counting Function Classes
por: Ivanashev, Yaroslav
Publicado: (2025)

A Hierarchy of Tinhofer Graphs: Separations and Membership Testing
por: Bhattacharjee, Sutanay, et al.
Publicado: (2026)

Algorithmizing the Multiplicity Schwartz-Zippel Lemma
por: Bhandari, Siddharth, et al.
Publicado: (2021)

A primer on the closure of algebraic complexity classes under factoring
por: Bhargav, C. S., et al.
Publicado: (2025)

Debordering Closure Results in Determinantal and Pfaffian Ideals
por: Dey, Anakin, et al.
Publicado: (2025)

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

$m$-Eternal Dominating Set Problem on Subclasses of Chordal Graphs
por: Rai, Ashutosh, et al.
Publicado: (2026)

Almost-catalytic Computation
por: Bisoyi, Sagar, et al.
Publicado: (2024)

On Closure Properties of Read-Once Oblivious Algebraic Branching Programs
por: Armand, Jules, et al.
Publicado: (2025)

Tractability results for integration in subspaces of the Wiener algebra
por: Dick, Josef, et al.
Publicado: (2024)

Some structural complexity results for $\exists\mathbb R$
por: Meer, Klaus, et al.
Publicado: (2025)

New results in canonical polyadic decomposition over finite fields
por: Yang, Jason
Publicado: (2025)

Bounding the computational power of bosonic systems
por: Upreti, Varun, et al.
Publicado: (2025)

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

When quantum resources backfire: Non-gaussianity and symplectic coherence in noisy bosonic circuits
por: Upreti, Varun, et al.
Publicado: (2025)

How Global Calibration Strengthens Multiaccuracy
por: Casacuberta, Sílvia, et al.
Publicado: (2025)

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

Deterministic Weighted Automata under Partial Observability
por: Michaliszyn, Jakub, et al.
Publicado: (2024)

New Pseudorandom Generators and Correlation Bounds Using Extractors
por: Kumar, Vinayak M.
Publicado: (2025)

Query Lower Bounds for Correlation Clustering under Memory Constraints
por: Garg, Sumegha, et al.
Publicado: (2026)