### Table 3 Polynomial-Time Algorithms Take Better Advantage of Technology

"... In PAGE 12: ... Even more illuminating is the effect that a technological breakthrough improving computer speed would have. Table3 (taken from Papadimitriou, Steiglitz 1982, p. 165) demonstrates how the size of the largest instance solvable increases when a computer (or an algorithm) with the tenfold speed becomes available: The most striking insight from such a comparison is that for a polynomial function this size multiplies by some factor while for an exponential function... ..."

### Table 5 Polynomial-Time Algorithms Take Better Advantage of Technology

"... In PAGE 10: ... Even more illuminating is the effect that a technological breakthrough improving computer speed would have. Table5 (taken from Papadimitriou, Steiglitz 1982, p. 165) demonstrates... ..."

### Table 1: Wilkinson polynomial timings

1998

"... In PAGE 20: ... 7.1 Univariate Root Finding Table1 presents some timing results for univariate root nding. The exam- ples are from the family of Wilkinson polynomials W n (x)= Y i=1... ..."

Cited by 2

### Table 1: Existence of Polynomial Time Learning Algorithms

1993

"... In PAGE 25: ...quivalence queries consist of arbitrary read-once formulas. Q.E.D. 9 Summary and remarks Table1 summarizes what is known of the computational di culty of learning monotone and arbitrary read-once formulas according to six types of learning protocols. The entries are discussed in order below.... ..."

Cited by 107

### Table 1. Problems solvable in polynomial time

1998

Cited by 10

### Table 3: The maximal subalgebras of V which have a polynomial-time satis- ability problem.

"... In PAGE 16: ...emma 1.2 V-SAT(V23) is in P. Proof: Follows immediately from the de nition of V23 and the previous proposition. 2 Before we can show that the other algebras in Table3 have polynomial-time satis ability problems, we need an auxiliary de nition. De nition 1.... ..."

### Table 3: A polynomial-time algorithm for nding one (not necessarily optimal) MACPO

"... In PAGE 22: ... However, nding the optimal partial ordering \under reasonable optimality criteria quot; has been shown to be NP-hard [3]. In Table3 , we provide a polynomial-time algorithm for nding one (not necessarily optimal) minimal annotated consistent partial ordering. This algorithm is a variation on the one presented by [54], however, in order to handle conditional e ects, we must calculate the state between each step to determine whether the conditional e ects were active in the totally-ordered plan.... ..."

Cited by 2

### Table 2 Polynomial-Time Algorithms Take Better Advantage of Computation Time

"... In PAGE 12: ... Table2 (taken from Garey, Johnson 1979, p. 7) illustrates that in most cases polynomial algo- rithms make better use of given computer time because they are - at least up from a certain in- stance size - faster than exponential ones.... ..."

### Table 4 Polynomial-Time Algorithms Take Better Advantage of Computation Time

"... In PAGE 10: ... Table4 (taken from Garey, Johnson 1979, p. 7) illustrates that in most cases polynomial algo- rithms make better use of given computer time because they are - at least up from a certain in- stance size - faster than exponential ones.... ..."