Source: http://www-spires.fnal.gov/spires/find/books/www?keyword=Algorithm+Analysis+and+Problem+Complexity
Timestamp: 2019-04-19 00:15:32+00:00

Document:
Contents: Models and Mechanisms in Parallel Computation -- A general-purpose shared-memory model for parallel computation -- Supporting a coherent shared address space across SMP nodes: An application-driven investigation -- Single-message vs.
Contents: 0. Preliminaries -- 1. The Ehrenfeucht-Fraïssé Method -- 2. More on Games -- 3. 0–1 Laws -- 4. Satisfiability in the Finite -- 5. Finite Automata and Logic: A Microcosm of Finite Model Theory -- 6. Descriptive Complexity Theory -- 7.
O2??max -- 5. A Best Algorithm for O2?pmtn??max -- 6. On Flow and Job Shops -- 7. Discussions -- References -- Maxmin Formulation of the Apportionments of Seats to a Parliament -- 1. Introduction -- 2. Concepts and models -- 3.
-- References -- Heilbronn Problem for Six Points in a Planar Convex Body -- 1. Introduction -- 2. Prerequisites -- 3. Proof of the Main Theorem -- References -- Heilbronn Problem for Seven Points in a Planar Convex Body -- 1.
Models the Objective and Constraint Functions by Linear Interpolation -- 5. A Truncated SQP Algorithm for Large Scale Nonlinear Programming Problems -- 6. Performance of a Multifrontal Scheme for Partially Separable Optimization -- 7.
6. Summary -- References -- II. Backwards Analysis of Randomized Geometric Algorithms -- 1. Introduction -- 2. Delaunay Triangulations of Convex Polygons -- 3. Intersecting Line Segments -- 4. Constructing Planar Convex Hulls -- 5.
Type Results -- 3. The Ham-Sandwich Theorem -- 4. Centrally Symmetric Polytopes -- 5. Kneser’s Conjecture -- 6. Sphere Coverings -- References -- X. Recent Results in the Theory of Packing and Covering -- 1. Introduction -- 2.
-- 7. Restrictions on the Number of Neighbors in a Packing -- 8. Selected Topics in 3 Dimensions -- References -- XI. Recent Developments in Combinatorial Geometry -- 1. The Distribution of Distances -- 2. Graph Dimensions -- 3.
Geometric Graphs -- 4. Arrangements of Lines in Space -- References -- XII. Set Theoretic Constructions in Euclidean Spaces -- 0. Introduction -- 1. Simple Transfinite Constructions -- 2. Closed Sets or Better Well-Orderings -- 3.
Results -- 15.1 Matching Segments -- 15.2 Support of Existence -- 15.3 Algorithm of the Token Tracking Process -- 15.4 Grouping Tokens into Objects -- 15.5 Experimental Results -- 15.5.1 Synthetic Data -- 15.6 Summary -- 16.
Estimates -- §3. The Power Method -- §4. The QR Algorithm -- 4. Approximation -- §1. Preliminaries -- §2. The Approximation Theorems of Weierstrass -- §3. The General Approximation Problem -- §4. Uniform Approximation -- §5.
Bounds and Spline Approximation -- §6. Multidimensional Splines -- 7. Integration -- §1. Interpolatory Quadrature -- §2. Extrapolation -- §3. Gauss Quadrature -- §4. Special Quadrature Methods -- §5. Optimality and Convergence -- §6.

References: §3
 §4
 §1
 §2
 §3
 §4
 §5
 §6
 §1
 §2
 §3
 §4
 §5
 §6