%0 Journal Article
%T Bounded Recursively Enumerable Sets and Degrees
%A @Sui Yuefei$Institute of Software
%A Academia Sinica
%A Beijing
%A <br>Sui
%A Yuefei
%J 计算机科学技术学报
%D 1993
%I 
%X A new reducibility between the recursive sets is defined,which is appropriate to be used in the study of the polynomial reducibility and the NP-problem.
%K Bounded recursively enumerable sets
%K relations<br>NP问题
%K 有界递归可数集
%K 多项式可约性
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=A8B5862D3D1CD8DD301FDEA66D2EBB8C&yid=D418FDC97F7C2EBA&vid=5D311CA918CA9A03&iid=38B194292C032A66&sid=23CCDDCD68FFCC2F&eid=13553B2D12F347E8&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=0&reference_num=0