%0 Journal Article
%T EXTENDED BINARY SEARCH AND ITS APPLCATION IN DESIGN OF POLYNOMIAL-TIME ALGORITHM FOR LP<br>广义二分搜索及其在 LP 多项式算法复杂度证明中的应用
%A ZHANG XIANG-SUN DU DING-ZHU
%A <br>章祥荪
%A 堵丁柱
%J 系统科学与数学
%D 1990
%I 
%X This paper presents an unified methodology for design of polynomial-time algorithms forLP by summarizing Khachiyan's algorithm and Karmarkar's algorithm.The authors deve-loped the concepts of binary search are developel into the so-called extended binary search,whi-ch is used as an unified model to analyze the complexities of algorthms and to help designnew algorithms.
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=D21670517263CD1C529DA68FED184724&yid=8D39DA2CB9F38FD0&vid=F3090AE9B60B7ED1&iid=E158A972A605785F&sid=23410D0BDB501DF5&eid=09D368C679EC819B&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=0&reference_num=0