scientific article
From MaRDI portal
Publication:4032119
zbMath0796.68117MaRDI QIDQ4032119
Publication date: 28 April 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (3)
The fewest clues problem ⋮ Tiling figures of the plane with two bars ⋮ Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles
This page was built for publication:
