Imagen de Portada

Polynomial definability in constraint languages with few subpowers

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bulín, Jakub, Kompatscher, Michael
Formato:	Preprint
Publicado:	2023
Materias:	Logic in Computer Science Logic Rings and Algebras 68T27, 08A70, 68Q25 F.4.1
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Complexity Dichotomy for Temporal Valued Constraint Satisfaction Problems
por: Bodirsky, Manuel, et al.
Publicado: (2024)

Complexity Classification Transfer for CSPs via Algebraic Products
por: Bodirsky, Manuel, et al.
Publicado: (2022)

The Complexity of Resilience Problems via Valued Constraint Satisfaction
por: Bodirsky, Manuel, et al.
Publicado: (2023)

SMB algebras II: On the Constraint Satisfaction Problem over Semilattices of Mal'cev Blocks
por: Marković, Petar, et al.
Publicado: (2026)

Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages
por: Adsul, Bharat, et al.
Publicado: (2024)

Behavioural Conformances based on Lax Couplings
por: Wild, Paul, et al.
Publicado: (2025)

On the relative asymptotic expressivity of inference frameworks
por: Koponen, Vera, et al.
Publicado: (2022)

Graded Monad Coalgebras for Continuous-Time Transition Systems
por: Di Lavore, Elena, et al.
Publicado: (2026)

Arithmetics within the Linear Time Hierarchy
por: Pollett, Chris
Publicado: (2025)

Simulating and model checking membrane systems using strategies in Maude
por: Rubio, Rubén, et al.
Publicado: (2024)

Relational Connectors and Heterogeneous Bisimulations
por: Nora, Pedro, et al.
Publicado: (2024)

Notes on CSPs and Polymorphisms
por: Brady, Zarathustra
Publicado: (2022)

Constraint Satisfaction Problems over Finitely Bounded Homogeneous Structures: a Dichotomy between FO and L-hard
por: Dorochko, Leonid, et al.
Publicado: (2026)

Higher-Order Pattern Unification Modulo Similarity Relations
por: Dundua, Besik, et al.
Publicado: (2025)

The equational theory of the Weihrauch lattice with (iterated) composition
por: Pradic, Cécilia
Publicado: (2024)

On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman
por: Grochow, Joshua A., et al.
Publicado: (2021)

Count-Free Weisfeiler--Leman and Group Isomorphism
por: Collins, Nathaniel A., et al.
Publicado: (2022)

Strategies, model checking and branching-time properties in Maude
por: Rubio, Rubén, et al.
Publicado: (2024)

Model checking strategy-controlled systems in rewriting logic
por: Rubio, Rubén, et al.
Publicado: (2024)

Metalevel transformation of strategies
por: Rubio, Rubén, et al.
Publicado: (2024)

The Complexity of Resilience for Digraph Queries
por: Bodirsky, Manuel, et al.
Publicado: (2026)

Commutative N-polyregular functions
por: Lopez, Aliaume
Publicado: (2024)

Universal Algebra in UniMath
por: Amato, Gianluca, et al.
Publicado: (2021)

Tractable and Intractable Entailment Problems in Separation Logic with Inductively Defined Predicates
por: Echenim, Mnacho, et al.
Publicado: (2023)

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

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

The Golden Path to Guarded Monotone Strict NP
por: Barsukov, Alexey, et al.
Publicado: (2023)

On the existence of strong proof complexity generators
por: Krajicek, Jan
Publicado: (2022)

A Bisimulation-Invariance-Based Approach to the Separation of Polynomial Complexity Classes
por: Bruse, Florian, et al.
Publicado: (2026)

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

A Logic For Fresh Labelled Transition Systems
por: Bandukara, Mohamed H, et al.
Publicado: (2025)

A proof complexity conjecture and the Incompleteness theorem
por: Krajicek, Jan
Publicado: (2023)

A Qualitative Analysis of Kernel Extension for Higher Order Proof Checking
por: Wang, Shuai
Publicado: (2024)

On Woolhouse's Cotton-Spinning Problem
por: Groote, Jan Friso, et al.
Publicado: (2024)

Matching logic -- a new axiomatization
por: Leuştean, Laurenţiu, et al.
Publicado: (2025)

Notes on applicative matching logic
por: Leuştean, Laurenţiu
Publicado: (2025)

The Orientation Boundary for Step-Duplicating Recursors: Mechanized Impossibility, Escape, and Certification
por: Rahnama, Moses
Publicado: (2025)

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

Transordinal Fixed-Point Operators and Self-Referential Games: A Categorical Framework for Reflective Semantic Convergence
por: Alpay, Faruk, et al.
Publicado: (2025)

Encoding Argumentation Frameworks to Propositional Logic Systems
por: Tang, Shuai, et al.
Publicado: (2025)