Kirjojen hintavertailu. Mukana 12 595 353 kirjaa ja 12 kauppaa.

Kirjailija

J T Schwartz

Kirjat ja teokset yhdessä paikassa: 7 kirjaa, julkaisuja vuosilta 2001-2025, suosituimpien joukossa On Generators of the Banach Algebra L1 (0, Oo) and Related Questions. Vertaile teosten hintoja ja tarkista saatavuus suomalaisista kirjakaupoista.

Mukana myös kirjoitusasut: J.T. Schwartz

7 kirjaa

Kirjojen julkaisuhaarukka 2001-2025.

On the Complexity of Motion Planning for Multiple Independent Objects; Pspace Hardness of the "warehouseman's Problem"
This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact, and remains as true to the original work as possible. Therefore, you will see the original copyright references, library stamps (as most of these works have been housed in our most important libraries around the world), and other notations in the work.This work is in the public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work.As a reproduction of a historical artifact, this work may contain missing or blurred pages, poor pictures, errant marks, etc. Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant.
Programming with Sets

Programming with Sets

J.T. Schwartz; R.B.K. Dewar; E. Dubinsky; E. Schonberg

Springer-Verlag New York Inc.
2012
nidottu
The programming language SETL is a relatively new member of the so-called "very-high-level" class of languages, some of whose other well-known mem­ bers are LISP, APL, SNOBOL, and PROLOG. These languages all aim to reduce the cost of programming, recognized today as a main obstacle to future progress in the computer field, by allowing direct manipulation of large composite objects, considerably more complex than the integers, strings, etc., available in such well-known mainstream languages as PASCAL, PL/I, ALGOL, and Ada. For this purpose, LISP introduces structured lists as data objects, APL introduces vectors and matrices, and SETL introduces the objects characteristic for it, namely general finite sets and maps. The direct availability of these abstract, composite objects, and of powerful mathematical operations upon them, improves programmer speed and pro­ ductivity significantly, and also enhances program clarity and readability. The classroom consequence is that students, freed of some of the burden of petty programming detail, can advance their knowledge of significant algorithms and of broader strategic issues in program development more rapidly than with more conventional programming languages.
Set Theory for Computing

Set Theory for Computing

Domenico Cantone; J.T. Schwartz; Eugenio Omodeo; Alberto Policriti

Springer-Verlag New York Inc.
2011
nidottu
Set Theory for Computing offers an up-to-date and comprehensive account of set-oriented symbolic manipulation and automated reasoning methods. Mastering today's variety of systems with crisp, formal tools is a prerequisite for a high degree of control over sets and aggregates. The many algorithmic methods and deductive techniques in this book offer readers a clear view of the use of set-theoretic notions in such critical areas as specification of problems, data types, and solution methods; algorithmic program verification; and automated deduction.The rigorous and largely self-contained style of presentation addresses readers wanting to complement their set intuition with the ability to exploit it in specification and verification and master it by symbolic, logically based techniques and methods. This book will be of interest to graduates and researchers in theoretical computer science and computational logic and automated reasoning.
Set Theory for Computing

Set Theory for Computing

Domenico Cantone; J.T. Schwartz; Eugenio Omodeo; Alberto Policriti

Springer-Verlag New York Inc.
2001
sidottu
Set Theory for Computing offers an up-to-date and comprehensive account of set-oriented symbolic manipulation and automated reasoning methods. Mastering today's variety of systems with crisp, formal tools is a prerequisite for a high degree of control over sets and aggregates. The many algorithmic methods and deductive techniques in this book offer readers a clear view of the use of set-theoretic notions in such critical areas as specification of problems, data types, and solution methods; algorithmic program verification; and automated deduction.The rigorous and largely self-contained style of presentation addresses readers wanting to complement their set intuition with the ability to exploit it in specification and verification and master it by symbolic, logically based techniques and methods. This book will be of interest to graduates and researchers in theoretical computer science and computational logic and automated reasoning.