DeepAI AI Chat
Log In Sign Up

Descriptive Complexity of Deterministic Polylogarithmic Time

by   Flavio Ferrarotti, et al.
Software Competence Center Hagenberg
Universidad Nacional de La Matanza

We propose a logical characterization of problems solvable in deterministic polylogarithmic time (PolylogTime). We introduce a novel, two-sorted logic that separates the elements of the input domain from the bit positions needed to address these elements. In the course of proving that our logic indeed captures PolylogTime on finite ordered structures, we introduce a variant of random-access Turing machines that can access the relations and functions of the structure directly. We investigate whether an explicit predicate for the ordering of the domain is needed in our logic. Finally, we present the open problem to understand exactly which order-invariant queries are in PolylogTime.


page 1

page 2

page 3

page 4


The Polylog-Time Hierarchy Captured by Restricted Second-Order Logic

Let SO^plog denote the restriction of second-order logic, where second-o...

A Restricted Second-Order Logic for Non-deterministic Poly-Logarithmic Time

We introduce a restricted second-order logic SO^plog for finite structur...

Capturing Bisimulation-Invariant Exponential-Time Complexity Classes

Otto's Theorem characterises the bisimulation-invariant PTIME queries ov...

Descriptive complexity of real computation and probabilistic independence logic

We introduce a novel variant of BSS machines called Separate Branching B...

Deterministic oblivious distribution (and tight compaction) in linear time

In an array of N elements, M positions and M elements are "marked". We s...

Monadicity of Non-deterministic Logical Matrices is Undecidable

The notion of non-deterministic logical matrix (where connectives are in...

Safe Compilation for Hidden Deterministic Hardware Aliasing and Encrypted Computing

Hardware aliasing occurs when the same logical address sporadically acce...