Titlebook: Computing and Combinatorics; 7th Annual Internati Jie Wang Conference proceedings 2001 Springer-Verlag Berlin Heidelberg 2001 Graph.Graph t

Pierce

書目名稱Computing and Combinatorics影響因子(影響力)




書目名稱Computing and Combinatorics影響因子(影響力)學科排名




書目名稱Computing and Combinatorics網(wǎng)絡公開度




書目名稱Computing and Combinatorics網(wǎng)絡公開度學科排名




書目名稱Computing and Combinatorics被引頻次




書目名稱Computing and Combinatorics被引頻次學科排名




書目名稱Computing and Combinatorics年度引用




書目名稱Computing and Combinatorics年度引用學科排名




書目名稱Computing and Combinatorics讀者反饋




書目名稱Computing and Combinatorics讀者反饋學科排名

參考書目

Thermodynamik des Kraftfahrzeugsnumber of the envelope layers of .. When 1 = . = . (0 lt; € lt; 1), we propose an algorithm for computing the envelope layers of . in .(. log.p) time using . processors, where 1 = . = . 1-€/2 , and . is the functional inverse of Ackermann’s function which grows extremely slowly. The computational mo

貪婪的人

人類學家

自負的人

,Messung thermodynamischer Gr??en,A language is . if its intersection with every NP-complete language is in P. Such a language would provide an automatic method for generating easy instances of intractable problems. In this note, we give a complete characterization of universally polynomial languages that are context-free, answering an open question in [.].

冒號

冒號

FRONT

On Universally Polynomial Context-Free LanguagesA language is . if its intersection with every NP-complete language is in P. Such a language would provide an automatic method for generating easy instances of intractable problems. In this note, we give a complete characterization of universally polynomial languages that are context-free, answering an open question in [.].

細絲

Packing Two Disks into a Polygonal Environmentersect each other, are contained in ., and whose radius is maximized. Our main result is a simple randomized algorithm whose expected running time, on worst case input, is .(. log .). This is optimal in the algebraic decision tree model of computation.

古代

https://doi.org/10.1007/3-540-44679-6Graph; Graph theory; algorithms; combinatorics; complexity; complexity theory; computability; computational