scientific article
From MaRDI portal
Publication:3807187
zbMath0658.03025MaRDI QIDQ3807187
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
polynomial-time reductionssubrecursive degreestally setspolynomial-size circuitspolynomial-time degrees
Analysis of algorithms and problem complexity (68Q25) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items
Kolmogorov complexity and degrees of tally sets, On adaptive versus nonadaptive bounded query machines