:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Akshima, Besselman, Tyler, Chung, Kai-Min, Guo, Siyao, Yang, Tzu-Yi
Formato:	Preprint
Publicado:	2025
Materias:	Computational Complexity Information Theory
Acceso en línea:	https://arxiv.org/abs/2510.12112
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Direct Sums for Parity Decision Trees
por: Besselman, Tyler, et al.
Publicado: (2024)

Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles
por: Alrabiah, Omar, et al.
Publicado: (2024)

Computation-Utility-Privacy Tradeoffs in Bayesian Estimation
por: Chen, Sitan, et al.
Publicado: (2026)

Space-bounded online Kolmogorov complexity is additive
por: Bauwens, Bruno, et al.
Publicado: (2025)

Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations
por: Onah, Chinonso, et al.
Publicado: (2026)

Tight Bounds for Noisy Computation of High-Influence Functions, Connectivity, and Threshold
por: Gu, Yuzhou, et al.
Publicado: (2025)

On Estimating the Quantum Tsallis Relative Entropy
por: Bao, Jinge, et al.
Publicado: (2025)

Accessible Quantum Correlations Under Complexity Constraints
por: Yángüez, Álvaro, et al.
Publicado: (2026)

Nearly-Linear Time Seeded Extractors with Short Seeds
por: Doron, Dean, et al.
Publicado: (2024)

Quantum Advantages in (n,d)->1 Random Access Codes
por: Ambainis, Andris, et al.
Publicado: (2015)

Quantum state testing beyond the polarizing regime and quantum triangular discrimination
por: Liu, Yupan
Publicado: (2023)

A List of Complexity Bounds for Property Testing by Quantum Sample-to-Query Lifting
por: Chen, Kean, et al.
Publicado: (2025)

Polynomial-Time Optimal Group Selection via the Double-Commutator Eigenvalue Problem
por: Thornton, Mitchell A.
Publicado: (2026)

Quantum LDPC Codes with Transversal Non-Clifford Gates via Products of Algebraic Codes
por: Golowich, Louis, et al.
Publicado: (2024)

Oblivious Deletion Codes
por: Con, Roni, et al.
Publicado: (2025)

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

Structure Theorems (and Fast Algorithms) for List Recovery of Subspace-Design Codes
por: Goyal, Rohan, et al.
Publicado: (2025)

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

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

Key-agreement exists if and only if the "interactive vs non interactive Kolmogorov problem" is not in ioBPP: a short proof
por: Bauwens, Bruno, et al.
Publicado: (2025)

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

The Optimization of Random Tree Codes for Limited Computational Resources
por: Bacinoglu, B. Tan
Publicado: (2025)

Explicit Codes approaching Generalized Singleton Bound using Expanders
por: Jeronimo, Fernando Granha, et al.
Publicado: (2025)

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

A lower bound on the field size of convolutional codes with a maximum distance profile and an improved construction
por: Chen, Zitan
Publicado: (2023)

Relaxed Local Correctability from Local Testing
por: Kumar, Vinayak M., et al.
Publicado: (2023)

Broadcast Channel Coding: Algorithmic Aspects and Non-Signaling Assistance
por: Fawzi, Omar, et al.
Publicado: (2023)

Improved PIR Schemes using Matching Vectors and Derivatives
por: Ghasemi, Fatemeh, et al.
Publicado: (2024)

Exponential Lower Bounds for 2-query Relaxed Locally Decodable Codes
por: Block, Alexander R., et al.
Publicado: (2026)

Explicit Constant-Alphabet Subspace Design Codes
por: Goyal, Rohan, et al.
Publicado: (2026)

A proof of P != NP (New symmetric encryption algorithm against any linear attacks and differential attacks)
por: Ming, Gao
Publicado: (2022)

When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound?
por: Doron, Dean, et al.
Publicado: (2024)

Kolmogorov-Loveland betting strategies lose the Betting game on open sets
por: Petrović, Tomislav
Publicado: (2024)

Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions
por: Blocki, Jeremiah, et al.
Publicado: (2021)

Assembly Theory Reduced to Shannon Entropy and Rendered Redundant by Naive Statistical Algorithms
por: Ozelim, Luan, et al.
Publicado: (2024)

Optimal Proximity Gap for Folded Reed--Solomon Codes via Subspace Designs
por: Jeronimo, Fernando Granha, et al.
Publicado: (2026)

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

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

PAC codes with Bounded-Complexity Sequential Decoding: Pareto Distribution and Code Design
por: Moradi, Mohsen, et al.
Publicado: (2024)

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