scientific article
From MaRDI portal
Publication:3809788
zbMath0661.03035MaRDI QIDQ3809788
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
sparse setstally setspolynomial-size circuitsstructural complexity theorygeneralized Kolmogorov complexityself-producible circuitsintrinsic characterization of reduction classes
Complexity of computation (including implicit computational complexity) (03D15) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items (1)
This page was built for publication: