Reducibility by means of almost polynomial functions

DOI10.3103/s1066369x2212009xOpenAlexW4327777670MaRDI QIDQ6132642

Sergey S. Marchenkov

Publication date: 14 July 2023

Published in: Russian Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s1066369x2212009x

zbMATH Keywords

\(m\)-reducibilityalmost polynomial functions

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complete and incomplete Boolean degrees
• Closed left-r.e. sets
• Strong reducibilities
• Complete degrees of finite-state transformability
• Boolean reducibility
• Reducibility among Combinatorial Problems
• On maximal and minimal elements of partially ordered sets of Boolean degrees
• On the structure of partially ordered sets of Boolean degrees
• The complexity of theorem-proving procedures
• Statistical estimation of the structure of a finite population

This page was built for publication: Reducibility by means of almost polynomial functions