Computing and Combinatorics
From MaRDI portal
Publication:5716952
DOI10.1007/11533719zbMath1128.68364OpenAlexW4376561447MaRDI QIDQ5716952
Publication date: 11 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11533719
Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (4)
On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain ⋮ In Memoriam: Ker-I Ko (1950–2018) ⋮ Jordan Curves with Polynomial Inverse Moduli of Continuity ⋮ Jordan curves with polynomial inverse moduli of continuity
This page was built for publication: Computing and Combinatorics