Imagen de Portada

Dimensionality and randomness

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Barmpalias, George, Zhang, Xiaoyan
Formato:	Preprint
Publicado:	2024
Materias:	Logic Discrete Mathematics Information Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Growth and irreducibility in path-incompressible trees
por: Barmpalias, George, et al.
Publicado: (2022)

Computable one-way functions on the reals
por: Barmpalias, George, et al.
Publicado: (2024)

Collision-resistant hash-shuffles on the reals
por: Barmpalias, George, et al.
Publicado: (2025)

Complexity of inversion of functions on the reals
por: Barmpalias, George, et al.
Publicado: (2024)

Compression of enumerations and gain
por: Barmpalias, George, et al.
Publicado: (2023)

Redundancy Is All You Need (for CSP Sparsification)
por: Brakensiek, Joshua, et al.
Publicado: (2024)

First order complexity of finite random structures
por: Demin, Danila, et al.
Publicado: (2024)

Threshold rates for properties of random codes
por: Guruswami, Venkatesan, et al.
Publicado: (2020)

First order distinguishability of sparse random graphs
por: Hershko, Tal, et al.
Publicado: (2024)

Logic-based analogical proportions
por: Antić, Christian
Publicado: (2024)

A Note on Constructive Canonical Splitter Strategies in Nowhere Dense Graph Classes
por: Fuchser, Janne, et al.
Publicado: (2025)

Nested Sequents for Intuitionistic Grammar Logics via Structural Refinement
por: Lyon, Tim S.
Publicado: (2022)

Aggregation of evaluations without unanimity
por: Filmus, Yuval
Publicado: (2025)

Advances in Algorithmic Meta Theorems
por: Siebertz, Sebastian, et al.
Publicado: (2024)

Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes
por: Dreier, Jan, et al.
Publicado: (2024)

Separability Properties of Monadically Dependent Graph Classes
por: Bonnet, Édouard, et al.
Publicado: (2025)

Existential Positive Transductions of Sparse Graphs
por: Mählmann, Nikolas, et al.
Publicado: (2026)

Characterizations of monadically dependent tree-ordered weakly sparse structures
por: Buffière, Hector, et al.
Publicado: (2026)

Decomposition horizons and a characterization of stable hereditary classes of graphs
por: Braunfeld, Samuel, et al.
Publicado: (2022)

Epsilon-saturation for stable graphs and Littlestone classes
por: Malliaris, Maryanthe, et al.
Publicado: (2025)

On first-order transductions of classes of graphs
por: Braunfeld, Samuel, et al.
Publicado: (2022)

Forbidden Induced Subgraphs for Bounded Shrub-Depth and the Expressive Power of MSO
por: Mählmann, Nikolas
Publicado: (2025)

Beatty Sequences for a Quadratic Irrational: Decidability and Applications
por: Schaeffer, Luke, et al.
Publicado: (2024)

Common information in well-mixing graphs and applications to information-theoretic cryptography
por: Caillat-Grenier, Geoffroy, et al.
Publicado: (2024)

Reconstruction of multiple strings of constant weight from prefix-suffix compositions
por: Yang, Yaoyu, et al.
Publicado: (2024)

New Solutions to Delsarte's Dual Linear Programs
por: Chailloux, André, et al.
Publicado: (2024)

Reducing Data Fragmentation in Data Deduplication Systems via Partial Repetition and Coding
por: Li, Yun-Han, et al.
Publicado: (2024)

Algebraic Barriers to Halving Algorithmic Information Quantities in Correlated Strings
por: Romashchenko, Andrei
Publicado: (2025)

Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory
por: Gürpınar, Emirhan, et al.
Publicado: (2020)

Combinatorial Group Testing in Presence of Deletions
por: Gandikota, Venkata, et al.
Publicado: (2023)

Information Content and Entropy of Finite Patterns from a Combinatorial Perspective
por: Pocze, Zsolt
Publicado: (2025)

Spectral approach to the communication complexity of multi-party key agreement
por: Caillat-Grenier, Geoffroy, et al.
Publicado: (2023)

A distance-free approach to generalized weights
por: Di Giusto, Andrea, et al.
Publicado: (2025)

Improved Hotplug Caching Schemes Using PDAs and t-Designs
por: Rajput, Charul, et al.
Publicado: (2023)

Permutation Entropy for Signal Analysis
por: Kay, Bill, et al.
Publicado: (2023)

Linear Exact Repair in MDS Array Codes: A General Lower Bound and Its Attainability
por: Liu, Hai, et al.
Publicado: (2026)

The commutativity problem for effective varieties of formal series, and applications
por: Clemente, Lorenzo
Publicado: (2025)

Complete Compositional Syntax for Finite Transducers on Finite and Bi-Infinite Words
por: Carette, Titouan, et al.
Publicado: (2025)

Lower Bounds in Algebraic Complexity via Symmetry and Homomorphism Polynomials
por: Dwivedi, Prateek, et al.
Publicado: (2026)

Home Spaces and Invariants to Analyze Parameterized Petri Nets
por: Memmi, Gerard
Publicado: (2024)