scientific article
From MaRDI portal
Publication:2722006
zbMath0966.68080MaRDI QIDQ2722006
Publication date: 11 July 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60)
Related Items (2)
On the least exponential growth admitting uncountably many closed permutation classes ⋮ Unnamed Item
This page was built for publication:
