... definitions and basic results of discrete |
complexity
Basics in Discrete Complexity Theory Basics in Discrete Complexity Theory Ko, Ker-I |
theory, in particular, regarding the ... |
... This survey includes principal results on |
complexity
Inductive inference of recursive functions: Complexity bounds Inductive inference of recursive functions: Complexity bounds Freivalds, Rūsiņš; Bārzdiņš, Jānis; Podnieks, Kārlis |
of inductive inference for recursively ... |
... We consider the communication |
complexity
Security with Low Communication Overhead Security with Low Communication Overhead Beaver, D.; Feigenbaum, J.; Kilian, J.; Rogaway, P. |
of secure multiparty computations by ... |
... transitions. The first algorithm has time |
complexity
Efficient verification of determinate processes Efficient verification of determinate processes Qin, Huajun |
O(m+n log n) and space ... |
... the presence of a species richness-habitat |
complexity
The effects of habitat complexity on the macroinvertebrates colonising wood substrates in a lowland stream The effects of habitat complexity on the macroinvertebrates colonising wood substrates in a lowland stream O'Connor, N. A. |
relationship for macroinvertebrate species ... |
... paper presents a principle of minimum |
complexity
A principle of minimum complexity in evolution A principle of minimum complexity in evolution Lopez, Luis R.; Caulfield, H. John |
in evolving systems. ... |
... The Ziv-Lempel |
complexity
Ziv-Lempel Complexity for Periodic Sequences and its Cryptographic Application Ziv-Lempel Complexity for Periodic Sequences and its Cryptographic Application Mund, Sibylle |
is a well-known ... |
... 0<n. The quantityt 0 measures theshape- |
complexity
Efficient triangulation of simple polygons Efficient triangulation of simple polygons Toussaint, Godfried |
of thetriangulation delivered by the ... |
... simple and well defined operations and |
complexity
Space-time complexity in optical computing Space-time complexity in optical computing Caulfield, H. J. |
measures, the product of spatial ... |
... We study the linear |
complexity
The Linear Complexity Profile and the Jump Complexity of Keystream Sequences The Linear Complexity Profile and the Jump Complexity of Keystream Sequences Niederreiter, Harald |
profile and the jump ... |
... for retrieval. A tradeoff between time |
complexity
Storing shortest paths for a polyhedron Storing shortest paths for a polyhedron Chen, Jindong; Han, Yijie |
O(d log n/log d) and space ... |
... the next entry to be examined. The |
complexity
An Ω(n5/4) lower bound on the randomized complexity of graph properties An Ω(n5/4) lower bound on the randomized complexity of graph properties King, Valerie |
of a randomized algorithm is the expected ... |
... We are interested in the average case |
complexity
Probabilistic leader election on rings of known size Probabilistic leader election on rings of known size Abrahamson, Karl; Adler, Andrew; Higham, Lisa; Kirkpatrick, David |
of leader election (and related problems) ... |
... authors have concentrated on the message |
complexity
On the computational power needed to elect a leader On the computational power needed to elect a leader Itai, Alon |
, and have disregarded the amount of local ... |
... effect of bit change errors on the linear |
complexity
Linear complexity of transformed sequences Linear complexity of transformed sequences Fell, Harriet J. |
of finite sequences. ... |
... on the way in which the space |
complexity
On problems for which no oracle can help On problems for which no oracle can help Hromkovič, Juraj |
in oracle computations is measured) can ... |
... |
Complexity
Complexity Complexity Klir, George J. |
is perhaps as important a concept for ... |
... r>0, and this allows to estimate the |
complexity
On the complexity of following the central path of linear programs by linear extrapolation II On the complexity of following the central path of linear programs by linear extrapolation II Sonnevend, G.; Stoer, J.; Zhao, G. |
, i.e. the total numberN = N(R, δ) of ... |
... is itself a function of any λ-expression. |
Complexity
What is an efficient implementation of the λ-calculus? What is an efficient implementation of the λ-calculus? Frandsen, Gudmund S.; Sturtivant, Carl |
is expressed here as a function of v just ... |
... of messages exchanged (communication |
complexity
Communication and time complexity of a distributed election protocol Communication and time complexity of a distributed election protocol Jean-Marie, Alain; Baccelli, François |
) and the execution time (time ... |
... whenN is large and whose computational |
complexity
The principle of Selecten Jumping Searching andC,C0′,C* algorithms The principle of Selecten Jumping Searching andC,C0′,C* algorithms Gao, Q. S.; Li, L. H. |
are exponential by the general searching ... |
... chapter, we investigate the computational |
complexity
Ordinary Differentiation Equations Ordinary Differentiation Equations Ko, Ker-I |
of the solutions y of an ordinary ... |
... There is an enormous literature on the |
complexity
Complexity and System Descriptions Complexity and System Descriptions Rosen, Robert |
of systems, and with attempts at ... |
... measure we use for algorithms is theI/O |
complexity
The input/output complexity of transitive closure The input/output complexity of transitive closure Ullman, Jeffrey D.; Yannakakis, Mihalis |
of Kung and Hong, where we count 1 every ... |
... Summary We investigate the message |
complexity
On the complexity of computation in the presence of link failures: the case of a ring On the complexity of computation in the presence of link failures: the case of a ring Goldreich, Oded; Shrira, Liuba |
of distributed computations on rings of ... |