Bob caviness (33 resultados)

Condición: Good. Springer-Verlag, 1985. Cover very barely rubbed/soiled, edges/corners ever-so-slightly bumped; top edge ever-so-slightly soiled, fore and bottom edges very lightly soiled/bumped; binding tight; interior intact and very clean; a nice copy; due to the size/weight of this item additional shipping charges may apply. paperback. Good.…

Paperback. Condición: Very Good. Sorry, No international shipping on this item.Ex-library paperback in very nice condition with the usual markings and attachments. Text block clean and unmarked. Tight binding.

Trade paperback. Softcover Reprint of the Origi e. Very good. Minimal wear to cover.

Condición: New.

Paperback or Softback. Condición: New. Quantifier Elimination and Cylindrical Algebraic Decomposition. Book.

Condición: New.

Condición: New.

Condición: New. pp. 456.

Paperback. Condición: Brand New. 450 pages. 9.75x6.75x0.75 inches. In Stock.

Condición: New.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - George Collins' discovery of Cylindrical Algebraic Decomposition (CAD) as a method for Quantifier Elimination (QE) for the elementary theory of real closed fields brought a major breakthrough in automating mathematics with recent important applications in high-tech areas (e.g. robot motion), also stimulating fundamental research in computer algebra over the past three decades.This volume is a state-of-the-art collection of important papers on CAD and QE and on the related area of algorithmic aspects of real geometry. It contains papers from a symposium held in Linz in 1993, reprints of seminal papers from the area including Tarski's landmark paper as well as a survey outlining the developments in CAD based QE that have taken place in the last twenty years.…

Condición: As New. Unread book in perfect condition.

Condición: New.

Condición: New.

Condición: As New. Unread book in perfect condition.

Condición: As New. Unread book in perfect condition.

Paperback. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condición: As New. Unread book in perfect condition.

Taschenbuch. Condición: Neu. EUROCAL '85. European Conference on Computer Algebra. Linz, Austria, April 1-3, 1985. Proceedings | Volume 2: Research Contributions | Bob F. Caviness | Taschenbuch | xviii | Englisch | 1985 | Springer | EAN 9783540159841 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Algorithms for polynomial division.- Sparse hensel lifting.- Heugcd: How elementary upperbounds generate cheaper data.- Gaussian elimination over a euclidean ring.- Demonstration of reduce3 as implemented on a stand-alone Motorola 68000 based microcomputer.- The Scratchpad II computer algebra language and system.- The SAC-2 computer algebra system.- DOE-MACSYMA: Progress report.- Towards practical implementations of syllogistic.- Path resolution and semantic graphs.- Fast subsumption algorithms.- Substitution expressions: Extracting solutions of non-Horn clause proofs.- The complexity of elementary problems in archimedean ordered groups.- Progress on the equivalence problem.- Symbol representations of noncommutative algebras.- Algebraic computations in elementary catastrophe theory.- Bifurcation theory and computer algebra: An initial approach.- Factorization of polynomials by transcendental evaluation.- Factorization of rational polynomials in the Zassenhaus - Norm.- On decomposable and commuting polynomials.- Fast polynomial decomposition algorithms.- A program system for root finding.- A program system for factorization of polynomials with rational coefficients.- THKLISP as a base of formula manipulation systems.- AMP a system for algebraic computations.- The program ortocartan for applications in Einstein's relativity theory.- Sheep and classification in general relativity.- Norcan - A computer calculus program.- Demo of stensor.- Visual environments for symbolic computation.- Syntactic equivalences inducing semantic equivalences.- The Algos computational system.- Retrieval in a module library using formal specifications: Preliminary search using syntactic properties.- The J-Machine: Functional programming with combinators.- Symbolic algebra in problems ofnonlinear mechanics.- Macsyma's computation of dirac-bergmann algorithm for Hamiltonian syytems with constraints.- Infinite dimensional computer Lie algebra .- Application of computer algebra to the theory of the vibration-rotational spectra of diatomic molecules.- Algorithms for the character theory of the symmetric group.- Worst-case analysis of algorithms for computational problems on abelian permutation groups.- A completion of some coxeter groups.- A CAYLEY file of finite simple groups.- On some laws in PSL(2,q).- An adjacency algorithm for cylindrical algebraic decompositions of three-dimensional space.- A cluster-based cylindrical algebraic decomposition algorithm.- On mechanical quantifier elimination for elementary algebra and geometry: Solution of a nontrivial problem.- Gröbner bases using SAC2.- A polynomial-time algorithm for the topological type of a real algebraic curve.- An improved projection operation for cylindrical algebraic decomposition.- Arithmetic in quadratic fields with unique factorization.- About a new method for computing in algebraic number fields.- An algebraic implementation of packages.- The SMP pattern matcher.- An expression compression package for REDUCE based on factorization and controlled expansion.- STENSOR uses disc automatically for very large computations.- Numerical methods with automatic verification.- ACRITH - High accuracy arithmetic subroutine library.- Floating-point computation in PASCAL-SC with verified results.- PASCAL-SC demonstration accurate arithmetic for verified results.- A solution to the polynomial hensel-code conversion problem.- A posteriori interval analysis.- Symbolic manipulations on a computer and their application to generation and investigation of difference schemes.- Completeness in data typespecifications.- On solving the equality problem in theories defined by Horn clauses.- Reducing the complexity of the Knuth-Bendix completion algorithm: A 'unification' of different approaches.- A confluence criterion based on the generalised Newman Lemma.- ERIL - Equational reasoning: an interactive laboratory.- Implementation of a general completion procedure parameterized by built-in theories and strategi.…

Condición: New. pp. 676.

PAP. Condición: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

PAP. Condición: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

PF. Condición: New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -George Collins' discovery of Cylindrical Algebraic Decomposition (CAD) as a method for Quantifier Elimination (QE) for the elementary theory of real closed fields brought a major breakthrough in automating mathematics with recent important applications in high-tech areas (e.g. robot motion), also stimulating fundamental research in computer algebra over the past three decades.This volume is a state-of-the-art collection of important papers on CAD and QE and on the related area of algorithmic aspects of real geometry. It contains papers from a symposium held in Linz in 1993, reprints of seminal papers from the area including Tarski's landmark paper as well as a survey outlining the developments in CAD based QE that have taken place in the last twenty years. 456 pp. Englisch.…

Condición: New. Print on Demand pp. 456 67:B&W 6.69 x 9.61 in or 244 x 170 mm (Pinched Crown) Perfect Bound on White w/Gloss Lam.

Condición: New. PRINT ON DEMAND pp. 456.

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -George Collins¿ discovery of Cylindrical Algebraic Decomposition (CAD) as a method for Quantifier Elimination (QE) for the elementary theory of real closed fields brought a major breakthrough in automating mathematics with recent important applications in high-tech areas (e.g. robot motion), also stimulating fundamental research in computer algebra over the past three decades.This volume is a state-of-the-art collection of important papers on CAD and QE and on the related area of algorithmic aspects of real geometry. It contains papers from a symposium held in Linz in 1993, reprints of seminal papers from the area including Tarski¿s landmark paper as well as a survey outlining the developments in CAD based QE that have taken place in the last twenty years.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 456 pp. Englisch.…

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Algorithms for polynomial division.- Sparse hensel lifting.- Heugcd: How elementary upperbounds generate cheaper data.- Gaussian elimination over a euclidean ring.- Demonstration of reduce3 as implemented on a stand-alone Motorola 68000 based microcomputer.- The Scratchpad II computer algebra language and system.- The SAC-2 computer algebra system.- DOE-MACSYMA: Progress report.- Towards practical implementations of syllogistic.- Path resolution and semantic graphs.- Fast subsumption algorithms.- Substitution expressions: Extracting solutions of non-Horn clause proofs.- The complexity of elementary problems in archimedean ordered groups.- Progress on the equivalence problem.- Symbol representations of noncommutative algebras.- Algebraic computations in elementary catastrophe theory.- Bifurcation theory and computer algebra: An initial approach.- Factorization of polynomials by transcendental evaluation.- Factorization of rational polynomials in the Zassenhaus ¿ Norm.- On decomposable and commuting polynomials.- Fast polynomial decomposition algorithms.- A program system for root finding.- A program system for factorization of polynomials with rational coefficients.- THKLISP as a base of formula manipulation systems.- AMP a system for algebraic computations.- The program ortocartan for applications in Einstein's relativity theory.- Sheep and classification in general relativity.- Norcan ¿ A computer calculus program.- Demo of stensor.- Visual environments for symbolic computation.- Syntactic equivalences inducing semantic equivalences.- The Algos computational system.- Retrieval in a module library using formal specifications: Preliminary search using syntactic properties.- The J-Machine: Functional programming with combinators.- Symbolic algebra in problems of nonlinear mechanics.- Macsyma's computation of dirac-bergmann algorithm for Hamiltonian syytems with constraints.- Infinite dimensional computer Lie algebra .- Application of computer algebra to the theory of the vibration-rotational spectra of diatomic molecules.- Algorithms for the character theory of the symmetric group.- Worst-case analysis of algorithms for computational problems on abelian permutation groups.- A completion of some coxeter groups.- A CAYLEY file of finite simple groups.- On some laws in PSL(2,q).- An adjacency algorithm for cylindrical algebraic decompositions of three-dimensional space.- A cluster-based cylindrical algebraic decomposition algorithm.- On mechanical quantifier elimination for elementary algebra and geometry: Solution of a nontrivial problem.- Gr¿bner bases using SAC2.- A polynomial-time algorithm for the topological type of a real algebraic curve.- An improved projection operation for cylindrical algebraic decomposition.- Arithmetic in quadratic fields with unique factorization.- About a new method for computing in algebraic number fields.- An algebraic implementation of packages.- The SMP pattern matcher.- An expression compression package for REDUCE based on factorization and controlled expansion.- STENSOR uses disc automatically for very large computations.- Numerical methods with automatic verification.- ACRITH ¿ High accuracy arithmetic subroutine library.- Floating-point computation in PASCAL-SC with verified results.- PASCAL-SC demonstration accurate arithmetic for verified results.- A solution to the polynomial hensel-code conversion problem.- A posteriori interval analysis.- Symbolic manipulations on a computer and their application to generation and investigation of difference schemes.- Completeness in data type specifications.- On solving the equality problem in theories defined by Horn clauses.- Reducing the complexity of the Knuth-Bendix completion algorithm: A 'unification' of different approaches.- A confluence criterion based on the generalised Newman Lemma.- ERIL ¿ Equational reasoning: an interactive laboratory.- Implementation of a general completion procedure parameterized by built-in theories and strategies.- Computer algebra in Norway.- Goppa codes: Algorithmic problems.- Gcd's and factoring multivariate polynomials using Grobner bases.- A note on the complexity of constructing standard bases.- Some algorithmic questions on ideals of differential operators.- Obtaining complete sets of reductions and equations without using special unification algorithms.- An overview of completion algorithms.- The optimisation by 'code motion' of user programs for an algebraic manipulation system.- An improved plotting package for VAXIMA.- On logic programs with data-driven computations.- Darwin, a system designed for the study of enumerative combinatorics.- Correctness proofs of the implementation of abstract data types.- Using prolog for constructing geometric objects defined by constraints.- The role of symbolic computation in the management of scientific information.- CIM (computer integrated manufacturing) ¿ A challenge for symbolic computation.- Symbolic and algebraic computation may support secondary education.- Software toolkit for input stage measurement in symbolic compuation.- The algebraic manipulation systems on the electrical power systems.- A new method of computing fundamental units in algebraic number fields.- The generalized Voronoi-algorithm in totally real algebraic number fields.- An algorithm for the computation of perfect polyhedral cones over real quadratic number fields.- Explicit determination of non-trivial torsion structures of elliptic curves over quadratic number fields.- p-Adic algorithms and the computation of zeros of p-adic l-functions.- On the solution of the diophantine equation Gn=pz.- Term orderings on the polynomial ring.- An algorithmic approach to local rings.- A reduction strategy for the taylor resolution.- From polynomials to Galois groups.- A system for parallel computer algebra programs.- Unification in parallel with refined linearity test: An example of recursive network stru.…

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Algorithms for polynomial division.- Sparse hensel lifting.- Heugcd: How elementary upperbounds generate cheaper data.- Gaussian elimination over a euclidean ring.- Demonstration of reduce3 as implemented on a stand-alone Motorola 68000 based microcomputer.…