Enumeration complexity of logical query problems with second-order variables
type: Item
instance of: scholarly article
zbMATH Open document ID: 1247.68073
author: Arnaud Durand
author: Yann Strozecki
publication date: 2012-09-18T00:00:00Z
full work available at URL: frontdoor ee39.html
Mathematics Subject Classification ID: 68P15
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 68Q19
zbMATH DE Number: 6083539
zbMATH Keywords: descriptive complexity
zbMATH Keywords: enumeration
zbMATH Keywords: query problem
MaRDI profile type: Publication
OpenAlex ID: W2240520130
DOI: 10.4230/LIPICS.CSL.2011.189
Recommended article: Two-variable first order logic with counting quantifiers: complexity results
Recommended article: Complexity Results for First-Order Two-Variable Logic with Counting
Recommended article: Enumeration of monadic second-order queries on trees
Recommended article: Q3305356
Recommended article: Enumeration complexity of conjunctive queries with functional dependencies
Recommended article: The Relational Polynomial-Time Hierarchy and Second-Order Logic
Recommended article: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
Recommended article: The complexity of first-order and monadic second-order logic revisited
Recommended article: Complexity and expressive power of second‐order extended Horn logic
Recommended article: Q3543581
title: Enumeration complexity of logical query problems with second-order variables
description: scientific article; zbMATH DE number 6083539