<div class="description">
<dl><dd>Title from cover</dd>
<dd>"Prepared for: Chief of Naval Research"--Cover</dd>
<dd>"November 1986"--Cover</dd>
<dd>"NPS52-86-024"--Cover</dd>
<dd>Includes bibliographical references (p. 12)</dd>
<dd>Technical report; 1986</dd>
<dd>This paper investigates the relations between two complexity functions when they have the same order class on a subsequence. Sufficient conditions are derived for concluding that two functions have the same order class if they are sufficiently related on a subsequence. These theoretical results are used to prove order class properties of complexity functions arising from divide and conquer problems. In addition, it is shown that between any two comparable non-constant order classes there are order classes that are incomparable</dd>
<dd>kmc/kmc 11/4/09</dd>
<dd>aq/aq cc:9116 02/27/98</dd></dl><br>Subjects: STOCHASTIC PROCESSES.; PROBABILITIES.; SEARCH THEORY.; SYSTEM ANALYSIS.</div>
<div class="fn value">
Davis, Daniel Lee, 1943-;Huber, Hartmut.</div>
Internet Archive identifier