Copertina

Encoding of algebraic geometry codes with quasi-linear complexity $O(N\log N)$

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Li, Songsong, Liu, Shu, Ma, Liming, Wan, Yunqi, Xing, Chaoping
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Computational Complexity
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Quasi-linear time decoding of RS and AG codes for burst errors up to the Singleton bound
di: Li, Songsong, et al.
Pubblicazione: (2025)

Reducing the Complexity of Matrix Multiplication to $O(N^2log_2N)$ by an Asymptotically Optimal Quantum Algorithm
di: Yao, Jiaqi, et al.
Pubblicazione: (2026)

On quasi-log structures for complex analytic spaces
di: Fujino, Osamu
Pubblicazione: (2022)

Matrix-by-matrix multiplication algorithm with $O(N^2log_2N)$ computational complexity for variable precision arithmetic
di: Paszyński, Maciej
Pubblicazione: (2024)

The PCP-like Theorem for Sub-linear Time Inapproximability
di: Ma, Hengzhao, et al.
Pubblicazione: (2021)

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

Transcendental Encoding conjecture
di: Keshavan, Anand Kumar, et al.
Pubblicazione: (2025)

Algebraic Geometry Codes for Distributed Matrix Multiplication Using Local Expansions
di: Li, Jiang, et al.
Pubblicazione: (2024)

Refuting approaches to the log-rank conjecture for XOR functions
di: Hatami, Hamed, et al.
Pubblicazione: (2023)

Asymptotic construction of locally repairable codes with multiple recovering sets
di: Li, Singsong, et al.
Pubblicazione: (2024)

Associative algebras in $CR$-geometry
di: Beloshapka, Valerii
Pubblicazione: (2026)

Instance complexity of Boolean functions
di: Liu, Alison Hsiang-Hsuan, et al.
Pubblicazione: (2023)

On the complexity and approximability of Bounded access Lempel Ziv coding
di: Cicalese, Ferdinando, et al.
Pubblicazione: (2024)

Decoding Balanced Linear Codes With Preprocessing
di: Bogdanov, Andrej, et al.
Pubblicazione: (2025)

Hardness of Random Reordered Encodings of Parity for Resolution and CDCL
di: Chew, Leroy, et al.
Pubblicazione: (2024)

Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication
di: Riazanov, Artur, et al.
Pubblicazione: (2025)

PCF Learned Sort: a Learning Augmented Sort Algorithm with $O(n \log\log n)$ Expected Complexity
di: Sato, Atsuki, et al.
Pubblicazione: (2024)

A nearly-$4\log n$ depth lower bound for formulas with restriction on top
di: Wu, Hao
Pubblicazione: (2024)

On the quantum computational complexity of classical linear dynamics with geometrically local interactions: Dequantization and universality
di: Sakamoto, Kazuki, et al.
Pubblicazione: (2025)

The complexity of computing in continuous time: space complexity is precision
di: Blanc, Manon, et al.
Pubblicazione: (2024)

Average-Case Hardness of Binary-Encoded Clique in Proof and Communication Complexity
di: de Rezende, Susanna F., et al.
Pubblicazione: (2026)

Decision algorithms for reversibility of one-dimensional non-linear cellular automata under null boundary conditions
di: Junchi, Ma, et al.
Pubblicazione: (2024)

On the complexity of Multipacking
di: Das, Sandip, et al.
Pubblicazione: (2026)

Quantum and Classical Communication Complexity of Permutation-Invariant Functions
di: Guan, Ziyi, et al.
Pubblicazione: (2023)

Average-case deterministic query complexity of boolean functions with fixed weight
di: Li, Yuan, et al.
Pubblicazione: (2024)

DQC1-completeness of normalized trace estimation for functions of log-local Hamiltonians
di: Ji, Zhengfeng, et al.
Pubblicazione: (2026)

On the Minimum Depth of Circuits with Linear Number of Wires Encoding Good Codes
di: Drucker, Andrew, et al.
Pubblicazione: (2024)

Unambiguous parity-query complexity
di: Gavinsky, Dmytro
Pubblicazione: (2024)

Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs
di: Gupta, Chetan, et al.
Pubblicazione: (2025)

Near-Optimal Encodings of Cardinality Constraints
di: Krapivin, Andrew, et al.
Pubblicazione: (2026)

On complexity of restricted fragments of Decision DNNF
di: Calí, Andrea, et al.
Pubblicazione: (2025)

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

SVP$_p$ is Deterministically NP-Hard for all $p > 2$, Even to Approximate Within a Factor of $2^{\log^{1-\varepsilon} n}$
di: Hair, Isaac M., et al.
Pubblicazione: (2025)

Anticoncentrated $n$-bit distribution from $\log(n)$ qubits
di: Zhang, Bingzhi, et al.
Pubblicazione: (2025)

Between the deterministic and non-deterministic query complexity
di: Gerbner, Dániel
Pubblicazione: (2019)

Expansion of higher-dimensional cubical complexes with application to quantum locally testable codes
di: Dinur, Irit, et al.
Pubblicazione: (2024)

Unconventional complexity classes in unconventional computing (extended abstract)
di: Porreca, Antonio E.
Pubblicazione: (2024)

The complexity of convexity number and percolation time in the cycle convexity
di: Lima, Carlos V. G. C., et al.
Pubblicazione: (2024)

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

A new metric for evaluating the performance and complexity of computer programs: A new approach to the traditional ways of measuring the complexity of algorithms and estimating running times
di: Folea, Rares, et al.
Pubblicazione: (2025)