Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Bounded recursively enumerable sets and degrees

From MaRDI portal
Publication:1338024
Jump to:navigation, search

DOI10.1007/BF02939527zbMath0807.03027MaRDI QIDQ1338024

Yuefei Sui

Publication date: 17 November 1994

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)


zbMATH Keywords

polynomial reducibilityNP-problembounded recursively enumerable setsreducibility between recursive sets


Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)





Cites Work

  • Unnamed Item
  • On the complexity of models of arithmetic
  • Bounded existential induction
  • Some problem in elementary arithmetics




This page was built for publication: Bounded recursively enumerable sets and degrees

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1338024&oldid=13470401"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 13:23.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki