### 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 1: Survey of classes of graphs optimaly solvable in polynomial time.

1998

"... In PAGE 2: ... The MinLA problem is known to be NP-hard and its decision version is NP-complete [12]. However, there exist polynomial time algorithms to compute exact solutions for some partic- ular classes of graphs, which we survey in Table1 . Notwithstanding these positive results, the decision problem remains NP-complete even if the input graph is bipartite [11].... ..."

Cited by 5

### 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 2: Generic polynomial multiplication timings

"... In PAGE 5: ....e. the small prime eld class from above. Table2 summarizes the results for multiplying polyno- mials of degree n = 1000 to n = 8000. It is important to note that the C++ timings do not contain the time spent in memory allocation and deallocation.... ..."

### Table 2: Generic polynomial multiplication timings

"... In PAGE 5: ....e. the small prime eld class from above. Table2 summarizes the results for multiplying polyno- mials of degree n = 1000 to n = 8000. It is important to note that the C++ timings do not contain the time spent in memory allocation and deallocation.... ..."

### Table 2: Generic polynomial multiplication timings

"... In PAGE 5: ....e. the small prime eld class from above. Table2 summarizes the results for multiplying polyno- mials of degree n = 1000 to n = 8000. It is important to note that the C++ timings do not contain the time spent in memory allocation and deallocation.... ..."