The existence of minimal honest polynomial degree below and recursively enumerable degrees

DOI10.1007/BF02560580zbMath0657.03023MaRDI QIDQ3804685

Dongping Yang

Publication date: 1988

Published in: Acta Mathematica Sinica (Search for Journal in Brave)

zbMATH Keywords

r.e. degreehonest polynomial reducibility

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Cites Work

• Minimal degrees for polynomial reducibilities

This page was built for publication: The existence of minimal honest polynomial degree below and recursively enumerable degrees