Theory of computational complexity by DulhDing Zhu

Algebraic complexity theory by Burgisser, Peter

Sets and computations

Subjects: “…Computational complexity…”

Introduction to automata theory, languages, and computation by Hopcroft, John E. 1939-

Subjects: “…Computational complexity…”

Elements of the theory of computation by Lewis, Harry R.

Subjects: “…Computational complexity.…”

Elements of the theory of computation by Lewis

Subjects: “…Computational complexity…”

Elements of the theory of computation by Lewis

Subjects: “…Computational complexity…”

The theory of computation

Table of Contents: “…Universal Models of Computation -- 5. Computability Theory -- 6. Complexity Theory: Foundations -- 7. …”

Theory of modeling and simulation integrating discrete even and continuous complex dynamic systems by Zeigler

Computer Science concepts and applications

Complex variables with Maple by Daud Mohamad

Cloud computing theory and practice by Marinescu, Dan C.

Artificial intelligence structures and strategies for complex problem solving by Luger, George F.

Artificial intelligence structures and strategies for complex problem solving by Luger

Discrete and continuous simulation theory and practice by Bandyopadhyay, Susmita, Bhattacharya, Ranjan

Handbook of research on generalized and hybrid set structures and applications for soft computing

Parallel solution methods in computational mathematics

Computational intelligence in archaeology by Barcelo, Juan A.

MyiLibrary
NetLibrary
MyiLibrary
ebrary

Foundations of computational mathematics selected papers of a conference held at Rio de Janeiro, January 1997

Table of Contents: “…-Algebras (Extended Abstract).- Condition Number Analysis for Sparse Polynomial Systems.- Residues in the Torus and Toric Varieties.- Piecewise Smooth Orthonormal Factors for Fundamental Solution Matrices.- Algorithms for computing finite semigroups.- Extended Grzegorczyk Hierarchy in the BSS Model of Computability.- Affine-Invariant Symmetry Sets.- On the Qualitative Properties of Modified Equations.- Numerical Methods on (and off) Manifolds.- On One Computational Scheme Solving the Nonstationary Schrodinger Equation with Polynomial Nonlinearity.- Newton Iteration Towards a Cluster of Polynomial Zeros.- Szemeredi's Regularity Lemma for Sparse Graphs.- Questions on Attractors of 3-Manifolds.- A Trust-Region SLCP Model Algorithm for Nonlinear Programming.- On the height used by additives BSS machines.- The Space Complexity of Elimination Theory: Upper Bounds.- Global Stochastic Recursive Algorithms.- Dynamical Recognizers: Real-time Language Recognition by Analog Computers (Extended Abstract).- Solving special polynomial systems by using structured matrices and algebraic residues.- Numerical Integration of Differential Equations on Homogeneous Manifolds.- A Convergence proof of an Iterative Subspace Method for Eigenvalues Problems.- Regularity of Minimizers of the Mumford-Shah Functional.- Tests and Constructions of Irreducible Polynomials over Finite Fields.- Numerical Linear Algebra in Optical Imaging.- Explicit symplectic integration of rod dynamics.- Toric Laminations, Sparse Generalized Characteristic Polynomials, and a Refinement of Hilbert's Tenth Problem.- Finite-Dimensional Feedback Control of a Scalar Reaction-Diffusion Equation via Inertial Manifold Theory.- Computational aspects of jacobian matrices.- Rigid body dynamics and measure differential inclusions.- Linear decision lists and partitioning algorithms for the construction of neural networks.- Ill-Posedness and Finite Precision Arithmetic: A Complexity Analysis for Interior Point Methods.- Iterated Commutators, Lie's Reduction Method and Ordinary Differential Equations on Matrix Lie Groups.…”

Computer-aided tolerancing proceedings of the 4th CIRP Design Seminar, the University of Tokyo, Tokyo, Japan, April 5-6, 1995