Titlebook: Complexity of Computer Computations; Proceedings of a sym Raymond E. Miller,James W. Thatcher,Jean D. Bohlin Conference proceedings 1972 Pl

effrontery

Parallel Iteration Methods,ons required to evaluate an n degree polynomial is about 2n/k + log.k, and showed a method which approaches this bound. Thus, for polynomial evaluation, one can achieve a good utilization of all the processes when their number is much smaller than the degree of the polynomial.

Perigee

Reducibility among Combinatorial Problems,lynomial in the length of the input. We show that a large number of classic unsolved problems of covering, matching, packing, routing, assignment and sequencing are equivalent, in the sense that either each of them possesses a polynomial-bounded algorithm or none of them does.

antedate

祖先

Julius Ossenberg-Engels,Vicente Grauions so far encountered. To process the command “x ≡ y”, the equivalence classes of x and y are determined. If they are the same, nothing further is done; otherwise the two classes are merged together.

Nonconformist

洞察力

Conference proceedings 1972ther combinatorial problems, iterative com­ putations, solving equations, and computer resource allocation. (2) Developing improved algorithms for the solution of such problems which provide good upper bounds on the number of required operations, along with experimental and v vi PREFACE theoretical

STANT

ting and other combinatorial problems, iterative com­ putations, solving equations, and computer resource allocation. (2) Developing improved algorithms for the solution of such problems which provide good upper bounds on the number of required operations, along with experimental and v vi PREFACE theoretical 978-1-4684-2003-6978-1-4684-2001-2

消音器

Raymond E. Miller,James W. Thatcher,Jean D. Bohlin

开始发作

Solving Linear Equations by Means of Scalar Products,nly operation permitted on the coefficient vectors a., a., ..., is the formation of scalar products a. ·v. Each such calculation is called a .. The objective is to solve the equations using a minimum number of tests.

可触知