Complexity of generation
type: Item
instance of: scholarly article
title: Complexity of generation
zbMATH Open document ID: 1484.68069
DOI: 10.1007/978-3-319-90530-3_1
publication date: 2018-11-28T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 52B55
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 6986102
zbMATH Keywords: generation algorithm
zbMATH Keywords: polynomial
zbMATH Keywords: quasi-polynomial
zbMATH Keywords: incremental
zbMATH Keywords: dualization
zbMATH Keywords: hypergraph
zbMATH Keywords: supergraph
zbMATH Keywords: backtrack
zbMATH Keywords: flash-light
zbMATH Keywords: dual-bounded
zbMATH Keywords: independent set
zbMATH Keywords: matroid
zbMATH Keywords: submodular function
zbMATH Keywords: polymatroid function
author: Vladimir Gurvich
MaRDI profile type: Publication
full work available at URL: 978-3-319-90530-3 1
OpenAlex ID: W2800856298
Recommended article: Generation Complexity Versus Distinction Complexity
Recommended article: On the complexity of discrete generation problems
Recommended article: Generative complexity in algebra
Recommended article: The complexity of certain incremental code generation problems
Recommended article: Generation problems
Recommended article: Mathematical Foundations of Computer Science 2004
Recommended article: Generative complexity of Gray-Scott model
Recommended article: Q4630802
Recommended article: Q3418262
Recommended article: COMPLEXITY OF SHORT GENERATING FUNCTIONS
description: scientific article; zbMATH DE number 6986102