Complexity of generation

DOI10.1007/978-3-319-90530-3_1zbMath1484.68069OpenAlexW2800856298MaRDI QIDQ1625133

Vladimir A. Gurvich

Publication date: 28 November 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-90530-3_1

zbMATH Keywords

hypergraphsubmodular functiondualizationindependent setpolynomialsupergraphmatroidbacktrackquasi-polynomialincrementalgeneration algorithmpolymatroid functiondual-boundedflash-light

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Computational aspects related to convexity (52B55) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles

This page was built for publication: Complexity of generation