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网络公开度




书目名称Computing and Combinatorics网络公开度学科排名




书目名称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