The complexity of semilinear problems in succinct representation
type: Item
instance of: scholarly article
title: The complexity of semilinear problems in succinct representation
zbMATH Open document ID: 1113.68057
author: Peter Bürgisser
author: Felipe Cucker
author: Paulin Jacobé de Naurois
published in: Computational Complexity
publication date: 2007-01-24T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 5118075
zbMATH Keywords: BSS additive model
zbMATH Keywords: semilinear sets
zbMATH Keywords: complete problems
MaRDI profile type: Publication
Wikidata QID: Q57733201
full work available at URL: s00037-006-0213-6
OpenAlex ID: W2043457210
DOI: 10.1007/S00037-006-0213-6
Recommended article: Fundamentals of Computation Theory
Recommended article: On the complexity of semidefinite programs
Recommended article: On Computational Complexity of Semilinear Varieties
Recommended article: Q4694758
Recommended article: Q3754444
Recommended article: The complexity of combinatorial problems with succinct input representation
Recommended article: Q3833618
Recommended article: The computational complexity of graph problems with succinct multigraph representation
Recommended article: Q5016357
Recommended article: Q2966411
description: scientific article; zbMATH DE number 5118075