|... We analyze the fine structure of time
|Extensional properties of sets of time bounded complexity (extended abstract)
Extensional properties of sets of time bounded complexity (extended abstract)
Maass, Wolfgang; Slaman, Theodore A.
|classes for RAM's, in particular the ...
|... By thequery-time
|Query complexity, or why is it difficult to separateNPA∩coNPA fromPA by random oraclesA?
Query complexity, or why is it difficult to separateNPA∩coNPA fromPA by random oraclesA?
|of a relativized algorithm we mean the ...
|... (circuit) Boolean computations and
|Through the mincing machine with a Boolean layer cake
Through the mincing machine with a Boolean layer cake
Belaga, Edward G.
|based on a strict separation of the syntax ...
|... This survey paper presents a
|On genuinely time bounded computations
On genuinely time bounded computations
Meyer auf der Heide, Friedhelm
|theoretical approach to genuinely time ...
|... of evolution of structure, order, and
|Evolution of structure, order and complexity in biological systems: Part III of a general theory
Evolution of structure, order and complexity in biological systems: Part III of a general theory
|are considered as characteristic features ...
|... the proposed definitions  for dynamical
|Dynamical Complexity of Strange Sets
Dynamical Complexity of Strange Sets
|reduce to entropy related quantities such ...
|... sense of direction affects the message
|Optimal fault-tolerant distributed algorithms for election in complete networks with a global sense of direction
Optimal fault-tolerant distributed algorithms for election in complete networks with a global sense of direction
Masuzawa, Toshimitsu; Nishikawa, Naoki; Hagihara, Ken'ichi; Tokura, Nobuki
|of LEP in faulty networks. ...
|... with the hierarchy of communication
|Chomsky hierarchy and communication complexity
Chomsky hierarchy and communication complexity
|for VLSI. ...
|... parallel algorithm, give its computational
|Parallel computer vision on Polymorphic Torus architecture
Parallel computer vision on Polymorphic Torus architecture
Maresca, Massimo; Li, Hungwen; Sheng, Michael M. C.
|, and compare such a ...
|... We study the
|Complexity of computation of embedded resolution of algebraic curves
Complexity of computation of embedded resolution of algebraic curves
Henry, J. P. G.; Merle, M.
|of an algorithm we gave in a former paper ...
|... performing hand (right/left) and in task-
|Negative cortical DC shifts preceding and accompanying simple and complex sequential movements
Negative cortical DC shifts preceding and accompanying simple and complex sequential movements
Lang, W.; Zilch, O.; Koska, C.; Lindinger, G.; Deecke, L.
|... be found in time O(m 3 n 3). The actual
|A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles
A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles
Avnaim, Francis; Boissonnat, Jean Daniel; Faverjon, Bernard
|of our algorithm inmany practical ...
|... use this lemma to obtain the following
|On paths in search or decision trees which require almost worst-case time
On paths in search or decision trees which require almost worst-case time
|theoretical results: 1) Searching in ...
|... relationship between increasing habitat
|Predator foraging success and habitat complexity: quantitative test of the threshold hypothesis
Predator foraging success and habitat complexity: quantitative test of the threshold hypothesis
Gotceitas, Vytenis; Colgan, Patrick
|and predator foraging success. ...
|... The distributed bit
|The distributed bit complexity of the ring: From the anonymous to the non-anonymous case
The distributed bit complexity of the ring: From the anonymous to the non-anonymous case
Bodlaender, Hans L.; Moran, Shlomo; Warmuth, Manfred K.
|of an asynchronous network of processors ...
|... generalized notions of low and high
|Generalized lowness and highness and probabilistic complexity classes
Generalized lowness and highness and probabilistic complexity classes
|classes and study their relation to ...
|... In proving the
|On the emptiness problem of tree automata and completeness of modal logics of programs
On the emptiness problem of tree automata and completeness of modal logics of programs
|of the satisfiability problem there was ...
|... the torus. We consider the bit and message
|Distributed computing on transitive networks: The torus
Distributed computing on transitive networks: The torus
Beame, Paul W.; Bodlaender, Hans L.
|of computing non-constant functions on an ...
|... an efficient (i.e. with low computational
|A robust preconditioner based on algebraic substructuring and two-level grids
A robust preconditioner based on algebraic substructuring and two-level grids
Axelsson, O.; Polman, B.
|) and robust, corrector on a coarse mesh. ...
|... In this paper we establish several tight
|Some complexity theoretic aspects of AC rewriting
Some complexity theoretic aspects of AC rewriting
Verma, Rakesh M.; Ramakrishnan, I. V.
|bounds on the sequential and parallel ...
|... a useful tool for the characterization of
|Reversals and alternation
Reversals and alternation
Buntrock, Gerhard; Hoene, Albrecht
|... selection problems, and study their
|The complexity of controlled selection
The complexity of controlled selection
Pruhs, Kirk; Manber, Udi
|... of the leishmaniases is gualitatitive
|Aetiology and Epidemiology: Overview
Aetiology and Epidemiology: Overview
Bradley, David J.
|. in no other parasitic genus infecting ...
|... There are numerous examples of temporal
|Spatio-temporal Complexity in Biological Systems
Spatio-temporal Complexity in Biological Systems
Sleeman, B. D.
|arising from models of logistic growth in ...
|Measures of Dimensions from Astrophysical Data
Measures of Dimensions from Astrophysical Data
Atmanspacher, H.; Demmel, V.; Morfill, G.; Scheingraber, H.; Voges, W.; Wiedenmann, G.
|of a system may have numerous aspects, and ...