AI Chat AI Image Generator AI Video Text to Speech

The complete classification for quantified equality constraints

04/01/2021

∙

by Dmitriy Zhuk, et al.

∙

∙

We prove that QCSP(ℕ;x=y→ y=z) is PSpace-complete, settling a question open for more than ten years. This completes the complexity classification for quantified equality languages as a trichotomy between Logspace, NP-complete and PSpace-complete.

Dmitriy Zhuk
12 publications
Barnaby Martin
30 publications

page 1

page 2

page 3

page 4

research

∙ 06/29/2019

QCSP monsters and the demise of the Chen Conjecture

We give a surprising classification for the computational complexity of ...

0 Dmitriy Zhuk, et al. ∙

research

∙ 06/15/2023

Functional Dependencies with Predicates: What Makes the g_3-error Easy to Compute?

The notion of functional dependencies (FDs) can be used by data scientis...

0 Simon Vilmin, et al. ∙

research

∙ 06/14/2018

Losing at Checkers is Hard

We prove computational intractability of variants of checkers: (1) decid...

0 Jeffrey Bosboom, et al. ∙

research

∙ 02/09/2022

Protocol Insecurity with Assertions

In the study of symbolic verification of cryptographic protocols, a cent...

0 R Ramanujam, et al. ∙

research

∙ 08/26/2023

Solving the insecurity problem for assertions

In the symbolic verification of cryptographic protocols, a central probl...

0 R Ramanujam, et al. ∙

research

∙ 11/21/2022

Equality of Effort via Algorithmic Recourse

This paper proposes a method for measuring fairness through equality of ...

0 Francesca E. D. Raimondi, et al. ∙

research

∙ 12/27/2013

The Garden Hose Complexity for the Equality Function

The garden hose complexity is a new communication complexity introduced ...

0 Well Y. Chiu, et al. ∙