Copertina

Computing the Elementary Symmetric Polynomials in Positive Characteristics

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Orzel, Ian
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Computational Complexity
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

The Algebraic Cost of a Boolean Sum
di: Orzel, Ian, et al.
Pubblicazione: (2025)

Symmetric Algebraic Circuits and Homomorphism Polynomials
di: Dawar, Anuj, et al.
Pubblicazione: (2025)

Beyond Bilinear Complexity: What Works and What Breaks with Many Modes?
di: Brand, Cornelius, et al.
Pubblicazione: (2026)

Positive Univariate Polynomials: SOS certificates, algorithms, bit complexity, and T-systems
di: Bender, Matías, et al.
Pubblicazione: (2025)

Computing Polynomial Representation in Subrings of Multivariate Polynomial Rings
di: Vu, Thi Xuan
Pubblicazione: (2025)

Information-Based Complexity vs Computational Complexity in Phaseless Polynomial Interpolation
di: Przybyłek, Michał R., et al.
Pubblicazione: (2026)

A New Reduction Method from Multivariate Polynomials to Univariate Polynomials
di: Wang, Cancan, et al.
Pubblicazione: (2024)

Elementary Quantum Recursion Schemes That Capture Quantum Polylogarithmic Time Computability of Quantum Functions
di: Yamakami, Tomoyuki
Pubblicazione: (2023)

A Lower Bound on Conservative Elementary Object Systems Coverability
di: Di Cosmo, Francesco, et al.
Pubblicazione: (2025)

Symmetric Distributions from Shallow Circuits
di: Kane, Daniel M., et al.
Pubblicazione: (2025)

Locally Sampleable Uniform Symmetric Distributions
di: Kane, Daniel M., et al.
Pubblicazione: (2024)

There is a Hyper-Greedoid lurking behind every Graphical Accessible Computational Search Problem solvable in Polynomial Time: $P \not= NP$
di: Kayibi, Koko-Kalambay Kalafan
Pubblicazione: (2018)

A Schematic Definition of Quantum Polynomial Time Computability
di: Yamakami, Tomoyuki
Pubblicazione: (2018)

On the Principal Minor Expansion and Complexity of the Symmetrized Determinant
di: Agarwal, Sanyam, et al.
Pubblicazione: (2026)

On Boolean PCSPs with Polynomial Threshold Polymorphisms
di: Michno, Katzper
Pubblicazione: (2025)

Lifting with Inner Functions of Polynomial Discrepancy
di: Manor, Yahel, et al.
Pubblicazione: (2024)

On Matrix Multiplication and Polynomial Identity Testing
di: Andrews, Robert
Pubblicazione: (2022)

On the Bit Size of Sum-of-Squares Proofs for Symmetric Formulations
di: Bortolotti, Alex, et al.
Pubblicazione: (2025)

Attacking the Polynomials in the Maze of Finite Fields problem
di: Barbero, Àngela, et al.
Pubblicazione: (2026)

One-Way Functions and Polynomial Time Dimension
di: Nandakumar, Satyadev, et al.
Pubblicazione: (2024)

On Factorization of Sparse Polynomials of Bounded Individual Degree
di: Chuyoon, Aminadav, et al.
Pubblicazione: (2026)

Exponential-Size Circuit Complexity is Comeager in Symmetric Exponential Time
di: Hitchcock, John M.
Pubblicazione: (2026)

Efficient Polynomial Identity Testing Over Nonassociative Algebras
di: Mukhopadhyay, Partha, et al.
Pubblicazione: (2025)

Polynomial-Time PIT from (Almost) Necessary Assumptions
di: Andrews, Robert, et al.
Pubblicazione: (2025)

Relating the Computational and Logical Difficulty of Solving ODEs: From Polynomial to Discontinuous Right-Hand Sides
di: Bournez, Olivier, et al.
Pubblicazione: (2026)

Almost Polynomial Factor Inapproximability for Parameterized k-Clique
di: S., Karthik C., et al.
Pubblicazione: (2021)

Extractors for Polynomial Sources over $\mathbb{F}_2$
di: Chattopadhyay, Eshan, et al.
Pubblicazione: (2023)

On Efficient Noncommutative Polynomial Factorization via Higman Linearization
di: Arvind, V., et al.
Pubblicazione: (2022)

Derandomizing Multivariate Polynomial Factoring for Low Degree Factors
di: Dutta, Pranjal, et al.
Pubblicazione: (2024)

Symmetric Parameterised Holants on Hypergraphs: Towards a Classification for Parameterised VCSPs
di: Aivasiliotis, Panagiotis, et al.
Pubblicazione: (2025)

Monotone Bounded Depth Formula Complexity of Graph Homomorphism Polynomials
di: Komarath, Balagopal, et al.
Pubblicazione: (2025)

Polynomial and analytic methods for classifying complexity of planar graph homomorphisms
di: Cai, Jin-Yi, et al.
Pubblicazione: (2024)

Symmetric quantum computation
di: Castro-Silva, Davi, et al.
Pubblicazione: (2025)

Upper Bounds for Symmetric Approximate Bounded Indistinguishability
di: Williamson, Christopher
Pubblicazione: (2026)

Low-Degree Polynomials Are Good Extractors
di: Alrabiah, Omar, et al.
Pubblicazione: (2024)

A Near-Optimal Polynomial Distance Lemma Over Boolean Slices
di: Amireddy, Prashanth, et al.
Pubblicazione: (2025)

A Pseudorandom Generator for Functions of Low-Degree Polynomial Threshold Functions
di: Yao, Penghui, et al.
Pubblicazione: (2025)

A Critique of Quigley's "A Polynomial Time Algorithm for 3SAT"
di: DeJesse, Nicholas, et al.
Pubblicazione: (2025)

Polynomial Lower Bounds for Arithmetic Circuits over Non-Commutative Rings
di: Raz, Ran
Pubblicazione: (2026)

A Critique of Du's "A Polynomial-Time Algorithm for 3-SAT
di: He, Yumeng, et al.
Pubblicazione: (2024)