Cover Image

A Pair of Bayesian Network Structures has Undecidable Conditional Independencies

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Li, Cheuk Ting
Format:	Preprint
Published:	2024
Subjects:	Computational Complexity Information Theory Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Communication with Imperfectly Shared Randomness
by: Canonne, Clément L., et al.
Published: (2014)

The Optimal Approximation Factor in Density Estimation
by: Bousquet, Olivier, et al.
Published: (2019)

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

The stochastic block model has the overlap graph property for modularity
by: Bhamidi, Shankar, et al.
Published: (2026)

Computational lower bounds for multi-frequency group synchronization
by: Kireeva, Anastasia, et al.
Published: (2024)

Sharp Thresholds Imply Circuit Lower Bounds: from random 2-SAT to Planted Clique
by: Gamarnik, David, et al.
Published: (2023)

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

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

On the Complexity of the Conditional Independence Implication Problem With Bounded Cardinalities
by: Makowski, Michał
Published: (2024)

Characterizations of Conditional Mutual Independence: Equivalence and Implication
by: Guo, Laigang, et al.
Published: (2026)

Rigorous Implications of the Low-Degree Heuristic
by: Hsieh, Jun-Ting, et al.
Published: (2026)

Transversal non-Clifford gates for quantum LDPC codes on sheaves
by: Lin, Ting-Chun
Published: (2024)

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

Oblivious Deletion Codes
by: Con, Roni, et al.
Published: (2025)

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

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

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

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

Symmetric Perceptrons, Number Partitioning and Lattices
by: Vafa, Neekon, et al.
Published: (2025)

Average-Case Reductions for $k$-XOR and Tensor PCA
by: Bresler, Guy, et al.
Published: (2026)

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

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

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

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

A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs
by: Janzer, Oliver, et al.
Published: (2024)

Information Accessibility Limits in Structured NP Search
by: Wei, Jing-Yuan
Published: (2026)

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

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

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

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

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

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

Half-duplex communication complexity with adversary can be less than the classical communication complexity
by: Dektiarev, Mikhail, et al.
Published: (2024)

Strong XOR Lemma for Information Complexity
by: Sawettamalya, Pachara, et al.
Published: (2024)

Some Thoughts on Symbolic Transfer Entropy
by: Jin, Dian
Published: (2024)

Improved List Size for Folded Reed-Solomon Codes
by: Srivastava, Shashank
Published: (2024)

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

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

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

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