Cover Image

Multiplication of polynomials over the binary field

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Liu, Chunlei
Format:	Preprint
Published:	2025
Subjects:	Number Theory Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On Polynomial Modular Number Systems over $\mathbb{Z}/p\mathbb{Z}$
by: Bajard, Jean Claude, et al.
Published: (2020)

A number-theoretic conjecture implying faster algorithms for polynomial factorization and integer factorization
by: Umans, Chris, et al.
Published: (2025)

A Note on Algorithms for Computing $p_n$
by: Aggarwal, Ansh
Published: (2025)

On Deterministically Finding an Element of High Order Modulo a Composite
by: Oznovich, Ziv, et al.
Published: (2025)

On Factoring and Power Divisor Problems via Rank-3 Lattices and the Second Vector
by: Gao, Yiming, et al.
Published: (2025)

Recovering short generators via negative moments of Dirichlet $L$-functions
by: Ng, Iu-Iong, et al.
Published: (2024)

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

An average case efficient algorithm for solving two-variable linear Diophantine equations
by: Deora, Mayank, et al.
Published: (2024)

Deterministically finding an element of large order in $\mathbb{Z}_N^*$
by: Nir, Itamar
Published: (2026)

Composition of random functions and word reconstruction
by: Chapuy, Guillaume, et al.
Published: (2026)

Computation of Jacobi sums of order l^2 and 2l^2 with prime l
by: Ahmed, Md. Helal, et al.
Published: (2019)

A degree 4 sum-of-squares lower bound for the clique number of the Paley graph
by: Kunisky, Dmitriy, et al.
Published: (2022)

Module Lattice Security (Part III): Structured CVP Distance on the Log-Unit Lattice
by: Luo, Ming-Xing
Published: (2026)

Dyadically resolving trinomials for fast modular arithmetic
by: Dougherty-Bliss, Robert, et al.
Published: (2025)

Universal Maximum Likelihood (List) Decoding via Fast Vector-Matrix Multiplication
by: Ly, Hoang, et al.
Published: (2025)

Optimal Approximate Matrix Multiplication over Sliding Window
by: Xian, Haoming, et al.
Published: (2025)

Certified binary search tree on W-types
by: Arengas, Gustavo
Published: (2024)

An Algorithm to Find Sums of Powers of Consecutive Primes
by: O'Sullivan, Cathal, et al.
Published: (2022)

On polynomial kernelization for Stable Cutset
by: Kratsch, Stefan, et al.
Published: (2024)

Randomized $k$-server in polynomial time
by: Coester, Christian, et al.
Published: (2026)

Grandchildren-weight-balanced binary search trees
by: Jugé, Vincent
Published: (2024)

Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets
by: Guo, Zeyu, et al.
Published: (2023)

On Approximate Fully-Dynamic Matching and Online Matrix-Vector Multiplication
by: Liu, Yang P.
Published: (2024)

Canonical forms for matrix tuples in polynomial time
by: Qiao, Youming, et al.
Published: (2024)

On Computing the Dollo-1 phylogeny in polynomial time
by: Bonizzoni, Paola, et al.
Published: (2016)

Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets
by: Con, Roni, et al.
Published: (2024)

Trading Prophets: How to Trade Multiple Stocks Optimally
by: Rajput, Surbhi, et al.
Published: (2025)

Matrix Multiplication Reductions
by: Gola, Ashish, et al.
Published: (2024)

Aligning Multiple Inhomogeneous Random Graphs: Fundamental Limits of Exact Recovery
by: Ameen, Taha, et al.
Published: (2024)

ExpoSort: Breaking the quasi-polynomial-time barrier for reluctant sorting
by: Abrahamsen, Mikkel
Published: (2024)

A faster polynomial-space algorithm for Hamiltonian cycle parameterized by treedepth
by: Kratsch, Stefan
Published: (2026)

Learning sparse generalized linear models with binary outcomes via iterative hard thresholding
by: Matsumoto, Namiko, et al.
Published: (2025)

Optimal Approximate Matrix Multiplication over Sliding Windows
by: Yao, Ziqi, et al.
Published: (2025)

Learning Multiple Secrets in Mastermind
by: Prabhu, Milind, et al.
Published: (2024)

Improving polynomial bounds for the Graphical Traveling Salesman Problem with release dates on paths
by: Clementino, Thailsson, et al.
Published: (2025)

Coloring for dispersion: A polynomial-time algorithm for cardinality-constrained 2-anticlustering
by: Tran, Nguyen Khoa, et al.
Published: (2026)

Multiplicative Spanners in Minor-Free Graphs
by: Bodwin, Greg, et al.
Published: (2025)

Max-Cut with Multiple Cardinality Constraints
by: Makarychev, Yury, et al.
Published: (2025)

High Probability Latency Sequential Change Detection over an Unknown Finite Horizon
by: Huang, Yu-Han, et al.
Published: (2024)

A polynomial delay algorithm generating all potential maximal cliques in triconnected planar graphs
by: Grigoriev, Alexander, et al.
Published: (2025)