scientific article; zbMATH DE number 1113995

zbMath0895.68070MaRDI QIDQ4375760

Richard E. Stearns, Venkatesh Radhakrishnan, Harry B. III Hunt, Madhav V. Marathe

Publication date: 2 March 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

polynomial time algorithm\(L\)-specificationsL-specifications

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies ⋮ Hierarchically specified unit disk graphs

This page was built for publication: