Cover Image

Computing Non-Repetitive Sequences with a Computable Lefthanded Local Lemma

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Mourad, Daniel
Format:	Preprint
Published:	2024
Subjects:	Logic Combinatorics 05C15, 05D40, 03D99, 68Q87 F.2.2; F.4.1; G.2.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?
by: Bannach, Max, et al.
Published: (2025)

Formal Probabilistic Methods for Combinatorial Structures using the Lovász Local Lemma
by: Edmonds, Chelsea, et al.
Published: (2023)

Complexities of Well-Quasi-Ordered Substructural Logics
by: Galatos, Nikolaos, et al.
Published: (2025)

The Fluted Fragment with Transitive Relations
by: Pratt-Hartmann, Ian, et al.
Published: (2020)

On the Descriptive Complexity of Groups without Abelian Normal Subgroups
by: Grochow, Joshua A., et al.
Published: (2022)

On the Realizability of Prime Conjectures in Heyting Arithmetic
by: Rosko, Milan
Published: (2025)

Complexity Results in Team Semantics: Nonemptiness Is Not So Complex
by: Anttila, Aleksi, et al.
Published: (2025)

On the Walsh and Fourier-Hadamard Supports of Boolean Functions From a Quantum Viewpoint
by: Carlet, Claude, et al.
Published: (2022)

Generalized Fractional Repetition Codes for Binary Coded Computations
by: Charalambides, Neophytos, et al.
Published: (2021)

A Logspace Constructive Proof of L=SL
by: Buss, Sam, et al.
Published: (2025)

The Tower of Hanoi: Optimality Proofs, Multi-Peg Bounds, and Computational Frontiers
by: Junyi, Qi
Published: (2025)

Adversarial Barrier in Uniform Class Separation
by: Rosko, Milan
Published: (2025)

Determination of the fifth Busy Beaver value
by: The bbchallenge Collaboration, et al.
Published: (2025)

Algorithmic Barriers to Detecting and Repairing Structural Overspecification in Adaptive Data-Structure Selection
by: Alpay, Faruk, et al.
Published: (2026)

Computability of Initial Value Problems
by: Brattka, Vasco, et al.
Published: (2024)

An arithmetic method algorithm optimizing k-nearest neighbors compared to regression algorithms and evaluated on real world data sources
by: Anagnostopoulos, Theodoros, et al.
Published: (2026)

NP-hard problems are not in BQP
by: Czerwinski, Reiner
Published: (2023)

Locality, Consistency, and the Tractability Frontier
by: Simas, Tristan
Published: (2026)

The Fractal Logic of Phi-adic Recursion
by: Rosko, Milan
Published: (2025)

A correspondence between the time and space complexity
by: Latkin, Ivan V.
Published: (2023)

Lindenmayer graph languages, first-order theories and expanders
by: Knapik, Teodor
Published: (2024)

The Solver's Paradox in Formal Problem Spaces
by: Rosko, Milan
Published: (2025)

About almost covering subsets of the hypercube
by: Ghosh, Arijit, et al.
Published: (2024)

Insignificant Choice Polynomial Time: A Logic Capturing PTIME
by: Schewe, Klaus-Dieter
Published: (2020)

Evolomino is NP-complete
by: Nikolaev, Andrei V.
Published: (2025)

Computability of the Hahn-Banach Theorem Revisited
by: Brattka, Vasco, et al.
Published: (2026)

Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes
by: Golovach, Petr A., et al.
Published: (2022)

TreeWidzard: An Engine for Width-Based Dynamic Programming and Automated Theorem Proving
by: Oliveria, Mateus de Oliveira, et al.
Published: (2026)

Labelled Well Quasi Ordered Classes of Bounded Linear Clique-Width
by: Lopez, Aliaume
Published: (2024)

Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization
by: Buchbinder, Niv, et al.
Published: (2024)

Online coloring of short interval graphs and two-count interval graphs
by: Curbelo, Israel R.
Published: (2024)

Conjunctive categorial grammars and Lambek grammars with additives
by: Kuznetsov, Stepan L., et al.
Published: (2024)

Uniform Computability of PAC Learning
by: Brattka, Vasco, et al.
Published: (2026)

Degree-preserving graph dynamics -- a versatile process to construct random networks
by: Erdős, Péter L., et al.
Published: (2021)

Psi-Turing Machines: Bounded Introspection for Complexity Barriers and Oracle Separations
by: Huseynzade, Rafig
Published: (2025)

A proof complexity conjecture and the Incompleteness theorem
by: Krajicek, Jan
Published: (2023)

Ramsey expansions of metrically homogeneous graphs
by: Aranda, Andrés, et al.
Published: (2017)

A Homological Separation of $\mathbf{P}$ from $\mathbf{NP}$ via Computational Topology and Category Theory
by: Tang, Jian-Gang
Published: (2025)

Model Checking for Low Monodimensionality Fragments of CMSO on Topological-Minor-Free Graph Classes
by: Sau, Ignasi, et al.
Published: (2026)

A Complexity Dichotomy in Spatial Reasoning via Ramsey Theory
by: Bodirsky, Manuel, et al.
Published: (2020)