| |
Browse All Reviews > Theory Of Computation (F) > Analysis Of Algorithms And Problem Complexity (F.2) > Tradeoffs between Complexity Measures (F.2.3)
|
|
 |
|
|
| |
|
|
| |
1-5 of 5
Reviews about "Tradeoffs between Complexity Measures (F.2.3)":
|
Date Reviewed |
| |
Using software complexity measures to analyze algorithms: an experiment with the shortest-paths algorithms
Nurminen J. Computers and Operations Research 30(8): 1121-1134, 2003. Type: Article
The goal of this paper is to investigate a relationship between three software complexity metrics--lines-of-code, Halstead’s volume, and cyclomatic number--and the running times of eight different algorithms...
|
Jul 24 2003 |
| |
Near-Optimal Time-Space Tradeoff for Element Distinctness
Yao A. SIAM Journal on Computing 23(5): 966-975, 1994. Type: Article
Anyone interested in time-space tradeoff results will be interested in this paper. Such tradeoff results have recently been obtained for various generic problems and computational models. The paper looks at the element distinctness pr...
|
Dec 1 1995 |
| |
Complexity of network synchronization
Awerbuch B. Journal of the ACM 32(4): 804-823, 1985. Type: Article
This paper presents a method of simulating a synchronous network using an asynchronous network. This is done by means of a synchronizer that generates “clock pulses” at each node on receipt of all messages that shou...
|
Feb 1 1986 |
| |
Area-time tradeoff for rectangular matrix multiplication in VLSI models
Lotti G. Information Processing Letters 19(2): 95-98, 1984. Type: Article
This paper provides what appears to be a more precise identification than the prior literature of the upper and lower bounds for the area-time tradeoff. The paper presents two propositions, one lemma, and one proof, but no numeric wor...
|
Mar 1 1985 |
| |
Space-Time Trade-Offs for Banded Matrix Problems
Savage J. Journal of the ACM 31(2): 422-437, 1984. Type: Article
Space-time tradeoffs are foften stated as lower bounds on the product of space and time. One way to obtain those lower bounds is the Grigoryev metho [1]. The paper under review presents a generalization of the Grigoryev method. For r...
|
Feb 1 1985 |
| |
|
|
| |
|
