scientific article; zbMATH DE number 1962844
From MaRDI portal
Publication:4418681
zbMATH Open1035.68055MaRDI QIDQ4418681
Marcus Schaefer, Frank Stephan
Publication date: 11 August 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2607/26070559.htm
Title of this publication is not available (Why is that?)
Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (2)
Nontriviality for exponential time w.r.t. weak reducibilities ⋮ Almost every set in exponential time is P-bi-immune
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418681)
