scientific article; zbMATH DE number 2080200
From MaRDI portal
Publication:4472442
zbMath1044.68061MaRDI QIDQ4472442
Heribert Vollmer, Pierre McKenzie, Klaus W. Wagner
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1974/19740164.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (2)
Characterizing Valiant's algebraic complexity classes ⋮ Integer circuit evaluation is PSPACE-complete
This page was built for publication:
