Cover Image

Complexity of Linear Equations and Infinite Gadgets

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Grebík, Jan, Vidnyánszky, Zoltán
Format:	Preprint
Published:	2025
Subjects:	Logic
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

From descriptive to distributed
by: Grebík, Jan, et al.
Published: (2025)

Deterministic Distributed Algorithms and Measurable Combinatorics on $Δ$-Regular Forests
by: Brandt, Sebastian, et al.
Published: (2022)

On Homomorphism Graphs
by: Brandt, Sebastian, et al.
Published: (2021)

FIID homomorphisms and entropy inequalities
by: Csoka, Endre, et al.
Published: (2024)

Measurable Vizing's theorem
by: Grebík, Jan
Published: (2023)

The ineffectiveness of the regularity lemma for bounded degree graphs
by: Lyons, Clark, et al.
Published: (2025)

Hyper-hyperfiniteness and complexity
by: Frisch, Joshua, et al.
Published: (2024)

Hyperfiniteness on Topological Ramsey Spaces
by: Bursics, Balázs, et al.
Published: (2024)

Complexity of Finite Borel Asymptotic Dimension
by: Grebík, Jan, et al.
Published: (2024)

The CSP Dichotomy, the Axiom of Choice, and Cyclic Polymorphisms
by: Kátay, Tamás, et al.
Published: (2023)

Realizations of countable Borel equivalence relations
by: Frisch, Joshua, et al.
Published: (2021)

Symmetric Linear Arc Monadic Datalog and Gadget Reductions
by: Bodirsky, Manuel, et al.
Published: (2024)

Embeddability on functions: order and chaos
by: Carroy, Raphaël, et al.
Published: (2018)

Space and Time Complexity for Infinite Time Turing Machines
by: Carl, Merlin
Published: (2019)

Infinite trees
by: Goy, Alexandre
Published: (2025)

Proof Complexity of Linear Logics
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2026)

SAT, Gadgets, Max2XOR, and Quantum Annealers
by: Ansótegui, Carlos, et al.
Published: (2024)

Computing with Infinite Objects: the Gray Code Case
by: Spreen, Dieter, et al.
Published: (2021)

Three Fundamental Questions in Modern Infinite-Domain Constraint Satisfaction
by: Pinsker, Michael, et al.
Published: (2025)

On the Complexity of the Grounded Semantics for Infinite Argumentation Frameworks
by: Andrews, Uri, et al.
Published: (2025)

Continuity in Potential Infinite Models
by: Eberl, Matthias
Published: (2025)

Algorithmic Randomness for Infinite Time Register Machines
by: Carl, Merlin
Published: (2014)

Randomness and Degree Theory for Infinite Time Register Machines
by: Carl, Merlin
Published: (2015)

Deciding Equations in the Time Warp Algebra
by: van Gool, Sam, et al.
Published: (2023)

Infinite Cliques in Simple and Stable Graphs
by: Halevi, Yatir, et al.
Published: (2024)

Apartness relations between propositions
by: Zoltan A. Kocsis
Published: (2024)

Infinite Time Recognizability from Random Oracles and the Recognizable Jump Operator
by: Carl, Merlin
Published: (2015)

The Lost Melody Theorem for Infinite Time Blum-Shub-Smale Machines
by: Carl, Merlin
Published: (2020)

Trace definability III: Infinite dimensional space over a model of $T$
by: Walsberg, Erik
Published: (2026)

Synthesis of Infinite State Systems
by: Drucker, Ohad, et al.
Published: (2025)

Cyclic Implicit Complexity
by: Curzi, Gianluca, et al.
Published: (2021)

Complexity of Safety and coSafety Fragments of Linear Temporal Logic
by: Artale, Alessandro, et al.
Published: (2022)

On Explicit Solutions to Fixed-Point Equations in Propositional Dynamic Logic
by: Lyon, Tim S.
Published: (2024)

The Complexity of the Constructive Master Modality
by: Santiago-Fernández, Sofía, et al.
Published: (2026)

A Linear Temporal Logic of Frequencies on Series of Events
by: Antonelli, Melissa, et al.
Published: (2026)

Parameterized Infinite-State Reactive Synthesis
by: Maderbacher, Benedikt, et al.
Published: (2025)

Linear Arboreal Categories
by: Abramsky, Samson, et al.
Published: (2023)

A Complete Finite Axiomatisation of the Equational Theory of Common Meadows
by: Bergstra, Jan A, et al.
Published: (2023)

Proof-theoretic Semantics for Intuitionistic Multiplicative Linear Logic (Extended Abstract)
by: Gheorghiu, Alexander V., et al.
Published: (2023)

Hyperarithmetical Complexity of Infinitary Action Logic with Multiplexing
by: Pshenitsyn, Tikhon
Published: (2023)