:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteur principal:	Li, Cheuk Ting
Format:	Preprint
Publié:	2024
Sujets:	Computational Complexity Information Theory Probability
Accès en ligne:	https://arxiv.org/abs/2405.07107
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Communication with Imperfectly Shared Randomness
par: Canonne, Clément L., et autres
Publié: (2014)

The Optimal Approximation Factor in Density Estimation
par: Bousquet, Olivier, et autres
Publié: (2019)

Computational Irreducibility as the Foundation of Agency: A Formal Model Connecting Undecidability to Autonomous Behavior in Complex Systems
par: Azadi, Poria
Publié: (2025)

The stochastic block model has the overlap graph property for modularity
par: Bhamidi, Shankar, et autres
Publié: (2026)

Computational lower bounds for multi-frequency group synchronization
par: Kireeva, Anastasia, et autres
Publié: (2024)

Sharp Thresholds Imply Circuit Lower Bounds: from random 2-SAT to Planted Clique
par: Gamarnik, David, et autres
Publié: (2023)

On the Complexity of the Conditional Independence Implication Problem With Bounded Cardinalities
par: Makowski, Michał
Publié: (2024)

Explicit Constant-Alphabet Subspace Design Codes
par: Goyal, Rohan, et autres
Publié: (2026)

Structure Theorems (and Fast Algorithms) for List Recovery of Subspace-Design Codes
par: Goyal, Rohan, et autres
Publié: (2025)

Rigorous Implications of the Low-Degree Heuristic
par: Hsieh, Jun-Ting, et autres
Publié: (2026)

Transversal non-Clifford gates for quantum LDPC codes on sheaves
par: Lin, Ting-Chun
Publié: (2024)

Symmetric Perceptrons, Number Partitioning and Lattices
par: Vafa, Neekon, et autres
Publié: (2025)

Average-Case Reductions for $k$-XOR and Tensor PCA
par: Bresler, Guy, et autres
Publié: (2026)

Characterizations of Conditional Mutual Independence: Equivalence and Implication
par: Guo, Laigang, et autres
Publié: (2026)

Quantum LDPC Codes with Transversal Non-Clifford Gates via Products of Algebraic Codes
par: Golowich, Louis, et autres
Publié: (2024)

Counterexample to majority optimality in NICD with erasures
par: Ivanisvili, Paata, et autres
Publié: (2025)

Phase transition of the 3-majority opinion dynamics with noisy interactions
par: d'Amore, Francesco, et autres
Publié: (2021)

Phase Transition of a Non-Linear Opinion Dynamics with Noisy Interactions
par: d'Amore, Francesco, et autres
Publié: (2020)

On the Minimum Depth of Circuits with Linear Number of Wires Encoding Good Codes
par: Drucker, Andrew, et autres
Publié: (2024)

Oblivious Deletion Codes
par: Con, Roni, et autres
Publié: (2025)

Expansion of higher-dimensional cubical complexes with application to quantum locally testable codes
par: Dinur, Irit, et autres
Publié: (2024)

Decoding Balanced Linear Codes With Preprocessing
par: Bogdanov, Andrej, et autres
Publié: (2025)

Quasi-linear time decoding of RS and AG codes for burst errors up to the Singleton bound
par: Li, Songsong, et autres
Publié: (2025)

Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions
par: Blocki, Jeremiah, et autres
Publié: (2021)

Low-degree estimation thresholds in planted hypergraphs and tensor PCA
par: Fu, Daniel, et autres
Publié: (2026)

Large Average Subtensor Problem: Ground-State, Algorithms, and Algorithmic Barriers
par: R., Abhishek Hegade K., et autres
Publié: (2025)

Testing Convex Truncation
par: De, Anindya, et autres
Publié: (2023)

Strong Low Degree Hardness for the Number Partitioning Problem
par: Mallarapu, Rushil, et autres
Publié: (2025)

Sharp Phase Transitions in Estimation with Low-Degree Polynomials
par: Sohn, Youngtak, et autres
Publié: (2025)

Exponential Lower Bounds for 2-query Relaxed Locally Decodable Codes
par: Block, Alexander R., et autres
Publié: (2026)

Information Accessibility Limits in Structured NP Search
par: Wei, Jing-Yuan
Publié: (2026)

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

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

A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs
par: Janzer, Oliver, et autres
Publié: (2024)

Improved PIR Schemes using Matching Vectors and Derivatives
par: Ghasemi, Fatemeh, et autres
Publié: (2024)

When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound?
par: Doron, Dean, et autres
Publié: (2024)

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

Assembly Theory Reduced to Shannon Entropy and Rendered Redundant by Naive Statistical Algorithms
par: Ozelim, Luan, et autres
Publié: (2024)

High Rate Multivariate Polynomial Evaluation Codes
par: Kopparty, Swastik, et autres
Publié: (2024)

PAC codes with Bounded-Complexity Sequential Decoding: Pareto Distribution and Code Design
par: Moradi, Mohsen, et autres
Publié: (2024)