Titlebook: Computing and Combinatorics; 9th Annual Internati Tandy Warnow,Binhai Zhu Conference proceedings 2003 Springer-Verlag Berlin Heidelberg 200

retort

书目名称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读者反馈学科排名

细胞膜

Outmoded

The Specker-Blatter Theorem Revisitedpecker and C. Blatter showed in 1981 that for every . N, .(.) satisfies a linear recurrence relation .over ℤ., and hence is ultimately periodic for each .. In this paper we show how the Specker-Blatter Theorem depends on the choice of constants and relations allowed in the definition of .. Among the main results we have the following:

GROG

On the Divergence Bounded Computable Real Numbers for various functions .. We will show a simple sufficient condition for class of functions such that the corresponding .-bc real numbers form a field. Then we prove a hierarchy theorem for .-bc real numbers. Besides we compare the semi-computability and weak computability with the .-bounded computability for special functions ..

狂怒

The Structure and Number of Global Roundings of a Graphry . ∈ ... We conjecture that there are at most |.| + 1 global roundings for .., and also the set of global roundings is an affine independent set. We give several positive evidences for the conjecture.

混乱生活

,Modellprozesse für Energieumwandlungen,ime to compute a (1 + .)-approximation with probability ≥ 1/2, and can be derandomized with an additional factor of .(..). Our technique is likely applicable to TSP problems of certain Jordan arcs and related problems.

混乱生活

,Modellprozesse für Energieumwandlungen,eralization of adjacencies, and as a key feature of genome rearrangement theories. We also show that sets of conserved intervals have elegant nesting and chaining properties that allow the development of compact graphic representations, and linear time algorithms to manipulate them.

宇宙你

,Modellprozesse für Stoffumwandlungen,gcd(. − 1, .) = 1 we have ..(.) = .(.. · (log.).). For char (.(.)) > 2 we prove that ..(.,4,.) = .(..), while for . = 2. we only have ..(. 4, .) = .(..). We can find matrices, fulfilling these lower bounds, in polynomial time. Our results extend and complement earlier results from .,., where the case . = 2 was considered.

harbinger

STELL

Phasenzerfall und Phasengleichgewichte the binary reachability, allowing the automatic verification of many interesting properties of a .. The . model can be used to specify and verify various systems with unbounded queues, such as a real-time scheduler.