... require at best quadratic time and space |
complexity
Reading many variables in one atomic operation solutions with linear or sublinear complexity Reading many variables in one atomic operation solutions with linear or sublinear complexity Kirousis, Lefteris M.; Spirakis, Paul; Tsigas, Philippas |
(the time ... |
... many lower bounds are known for the |
complexity
Lower bounds for the complexity of functions in a realistic RAM model Lower bounds for the complexity of functions in a realistic RAM model Bshouty, Nader H. |
of computing (or approximating) functions ... |
... 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 ... |
... of question, namely, that of Kolmogorov |
complexity
Introduction Introduction Watanabe, Osamu |
theory. ... |
... 2n −1 starts a different n-tuple, the |
complexity
Position recovery on a circle based on coding theory Position recovery on a circle based on coding theory Arazi, Benjamin |
of recovering the position of a given ... |
... relationship between measures of software |
complexity
Software Metrics and the Quality of Telecommunication Software Software Metrics and the Quality of Telecommunication Software Khoshgoftaar, Taghi M.; Munson, John C. |
and programming errors is explored. ... |
... We analyze the fine structure of the time |
complexity
Splitting and Density for the Recursive Sets of a Fixed Time Complexity Splitting and Density for the Recursive Sets of a Fixed Time Complexity Maass, Wolfgang; Slaman, Theodore A. |
classes induced by random access ... |
... are going to consider problems related to |
complexity
Bases and Computation in Finite Fields Bases and Computation in Finite Fields Shparlinski, Igor E. |
of computation in finite fields such as ... |
... This article deals with a measure of the |
complexity
Physical complexity and Zipf's law Physical complexity and Zipf's law Günther, R.; Schapiro, B.; Wagner, P. |
of a physical system recently proposed by ... |
... Dutch bay were structurally more complex ( |
complexity
Structural properties of two types of mangrove stands on the northwestern coast of Sri Lanka Structural properties of two types of mangrove stands on the northwestern coast of Sri Lanka Amarasinghe, M. D.; Balasubramaniam, S. |
indices 8.11–22.7) than the ... |
... of the investigations and on the other the |
complexity
Stochastic Integer Programming Stochastic Integer Programming Stougie, Leen |
of the problem type. ... |
... between the multi-party communication |
complexity
Functional Inversion and Communication Complexity Functional Inversion and Communication Complexity Teng, Shang-Hua |
over various communication topologies and ... |
... to goal. The conclusion reached is that A* |
complexity
New approaches for understanding the asymptotic complexity of A* tree searching New approaches for understanding the asymptotic complexity of A* tree searching Chenoweth, Stephen V.; Davis, Henry W. |
is an exponential function of heuristic ... |
... Dutch bay were structurally more complex ( |
complexity
Structural properties of two types of mangrove stands on the northwestern coast of Sri Lanka Structural properties of two types of mangrove stands on the northwestern coast of Sri Lanka Amarasinghe, M. D.; Balasubramaniam, S. |
indices 8.11–22.7) than the ... |
... exponential, average asymptotic time |
complexity
The mathematical modeling of heuristics The mathematical modeling of heuristics Davis, Henry W.; Chenoweth, Stephen V. |
. ... |
... We discuss the average case |
complexity
On average complexity of global optimization problems On average complexity of global optimization problems Wasilkowski, G. W. |
of global optimization problems. ... |
... which emphasizes the interplay between a |
complexity
Complexity Measures on Trees Complexity Measures on Trees Rice, Michael D. |
measure and an order on a set of software ... |
... As the |
complexity
A VHDL-Driven Synthesis Environment A VHDL-Driven Synthesis Environment Konuk, Haluk; Marschner, F. Erich |
and the size of the VLSI systems grow ... |
... This paper explores the structure of test |
complexity
On tests of uniform tree circuits On tests of uniform tree circuits Wu, Hongzhong |
classes of uniform tree circuits. ... |
... for improving the communication |
complexity
Sparser: A paradigm for running distributed algorithms Sparser: A paradigm for running distributed algorithms Afek, Yehuda; Ricklin, Moty |
of several classes of distributed ... |
... that adequately reflect the richness and |
complexity
Toward a Systems Theory of Public Relations Toward a Systems Theory of Public Relations Hazleton, Vincent |
of PR practice (Hazleton & Botan, 1989). ... |
... to study the sequential and parallel |
complexity
Rational transductions and complexity of counting problems Rational transductions and complexity of counting problems Choffrut, Christian; Goldwurm, Massimiliano |
of counting problems for regular and ... |
... and two applications of Communication |
Complexity
Communication Complexity and Lower Bounds for Sequential Computation Communication Complexity and Lower Bounds for Sequential Computation Kalyanasundaram, Bala; Schnitger, Georg |
are presented. ... |
... On one extreme the amortized |
complexity
Tentative and definite distributed computations: An optimistic approach to network synchronization Tentative and definite distributed computations: An optimistic approach to network synchronization Garofalakis, J.; Rajsbaum, S.; Spirakis, P.; Tampakas, B. |
of our synchronizer is O(1) messages and ... |
... trees of Nievergelt and Reingold. |
The complexity of on-line simulations between multidimensional turing machines and random access machines The complexity of on-line simulations between multidimensional turing machines and random access machines Loui, Michael C.; Luginbuhl, David R. |
... |