scientific article; zbMATH DE number 6423742
From MaRDI portal
Publication:4982348
zbMath1344.03036MaRDI QIDQ4982348
Peter H. Hertling, Victor L. Selivanov
Publication date: 9 April 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
NP-completenesstopological complexityWeihrauch reducibilitypolynomial-time computabilitylabeled forest
Partial orders, general (06A06) Complexity of computation (including implicit computational complexity) (03D15) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items (4)
Unnamed Item ⋮ Well-Quasi Orders and Hierarchy Theory ⋮ Complexity issues for the iterated \(h\)-preorders ⋮ Weihrauch Complexity in Computable Analysis
This page was built for publication:
