Titlebook: Mathematical Foundations of Computer Science 1995; 20th International S Ji?í Wiedermann,Petr Hájek Conference proceedings 1995 Springer-Ver

COAX

書目名稱Mathematical Foundations of Computer Science 1995影響因子(影響力)




書目名稱Mathematical Foundations of Computer Science 1995影響因子(影響力)學(xué)科排名




書目名稱Mathematical Foundations of Computer Science 1995網(wǎng)絡(luò)公開度




書目名稱Mathematical Foundations of Computer Science 1995網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Mathematical Foundations of Computer Science 1995被引頻次




書目名稱Mathematical Foundations of Computer Science 1995被引頻次學(xué)科排名




書目名稱Mathematical Foundations of Computer Science 1995年度引用




書目名稱Mathematical Foundations of Computer Science 1995年度引用學(xué)科排名




書目名稱Mathematical Foundations of Computer Science 1995讀者反饋




書目名稱Mathematical Foundations of Computer Science 1995讀者反饋學(xué)科排名

forebear

The complexity of interval routing on random graphs,, nodes assign up to . intervals to each incident link. A message is routed over a link if its destination belongs to one of the intervals of the link. We give some results for the necessary value of . in order to achieve shortest path routing. Even though for very structured networks low values of

RAG

Bridging across the log(n) space frontier,review the basic concepts of the space complexity theory and clarify the role of the space constructibility. Despite of the fact that the space below log . behaves radically different from the higher bounds, many important techniques do work on the both sides of this boundary. In addition, several i

Basilar-Artery

Second order logic and the weak exponential hierarchies,e first order closure of second order .. — captures the class .. = ., a natural intermediate class of the polynomial hierarchy [12]..In this paper we show that with respect to expression complexity, second order logic characterizes the levels of the weak exponential hierarchy EH. Moreover, we extend

pacifist

On the computing paradigm and computational complexity,the quantitative laws of computational complexity apply to all information processing from numerical computations and simulation to logical reasoning and formal theorem proving, as well as processes of rational reasoning..In this view, the search for what is and is not feasibly computable takes on a

匍匐前進(jìn)

創(chuàng)造性

Lacerate

WITH

Automata that take advice,compare it to other nonuniform models studied in connection with formal languages in the literature. Based on this we obtain complete separations of the classes of the Chomsky hierarchy relative to advices.

淺灘

Nonuniform lower bounds for exponential time classes,rov complexity, languages are constructed which witness that various exponential time classes are not included in (fixed) polynomial advice classes. We show as well that these languages are not included in small circuit families where the circuits are of a fixed, polynomial size. The results yield o