Computational complexity of arithmetical sentences
type: Item
instance of: scholarly article
title: Computational complexity of arithmetical sentences
zbMATH Open document ID: 0833.03002
author: Yanyan Li
published in: Information and Computation
publication date: 1996-03-17T00:00:00Z
Mathematics Subject Classification ID: 03B25
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 11U05
zbMATH DE Number: 797311
zbMATH Keywords: polynomial time
zbMATH Keywords: \(\exists \forall\) sentence
zbMATH Keywords: \(\forall \exists\) sentence
zbMATH Keywords: arithmetical sentence
zbMATH Keywords: co-NP-complete
zbMATH Keywords: decision problem
zbMATH Keywords: NP-complete
MaRDI profile type: Publication
full work available at URL: inco.1995.1116
OpenAlex ID: W1978898417
DOI: 10.1006/INCO.1995.1116
description: scientific article; zbMATH DE number 797311