Buss Samuel (45 results)

Hardcover. Condition: Good. 1st Edition. Library-discharged hardcover with typical library markings (lower spine, page edges, inside front and back covers, upper corners of the first few endpapers, copyright and preface pages). Absent these markings, this book would be excellent with slight handling. 350 pages, text entirely unmarked. [1.4 lbs]. Book.…

Condition: good. Supports Goodwill of Silicon Valley job training programs. The cover and pages are in Good condition! Any other included accessories are also in Good condition showing use. Use can include some highlighting and writing, page and cover creases as well as other types visible wear.

Hardcover. 350pp. Some neat highlighting on 3 pages, otherwise VG+ condition.

Condition: Very Good. 396 pp., hardcover, very good. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.

Condition: Very Good. Item in very good condition! Textbooks may not include supplemental items i.e. CDs, access codes etc.

Hardback. Condition: Very Good. This introduction to 3D computer graphics emphasizes fundamentals and the mathematics underlying computer graphics, while also covering programming techniques using OpenGL, a platform-independent graphics programming environment. The minimal prerequisites make it suitable for self-study or for use as an advanced undergraduate or introductory graduate text as the author leads step-by-step from the basics of transformations to advanced topics such as animations and kinematics. Accompanying software, including source code for a ray tracing software package, is available freely from the book's web site.…

soft cover. Condition: New book. No Jacket. Lecture Notes in Logic, 13. XV, 541 pages.

Hard Cover. Condition: Fine. Dust Jacket Condition: No Dust Jacket Present. 350 pages. "This book includes both the sudy of feasible compuation from a mathematical and logical point of view and the reworking of traditional mathematics from the point of view of feasible computation." FINE HARDCOVER. Size: 8vo - over 7¾" - 9¾" tall. …

Condition: Very Good.

Condition: Used. pp. 364.

Condition: Used. pp. 364 23:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on White w/Gloss Lam.

Condition: Used. pp. 364.

Hardcover. Condition: Very Good.

PF. Condition: New.

hardcover. Condition: New. In shrink wrap. Looks like an interesting title.

hardcover. Condition: new.

Hardcover. Condition: Brand New. 320 pages. 10.25x7.25x0.50 inches. In Stock.

Hardback. Condition: New. Questions of mathematical proof and logical inference have been a significant thread in modern mathematics and have played a formative role in the development of computer science and artificial intelligence. Research in proof complexity and feasible theories of arithmetic aims at understanding not only whether logical inferences can be made, but also what resources are required to carry them out. Understanding the resources required for logical inferences has major implications for some of the most important problems in computational complexity, particularly the problem of whether NP is equal to co-NP. In addition, these have important implications for the efficiency of automated reasoning systems. The last dozen years have seen several breakthroughs in the study of these resource requirements.Papers in this volume represent the proceedings of the DIMACS workshop on 'Feasible Arithmetics and Proof Complexity' held in April 1996 at Rutgers University in New Jersey as part of the DIMACS Institute's Special Year on Logic and Algorithms. This book brings together some of the most recent work of leading researchers in proof complexity and feasible arithmetic reflecting many of these advances. It covers a number of aspects of the field, including lower bounds in proof complexity, witnessing theorems and proof systems for feasible arithmetic, algebraic and combinatorial proof systems, interpolation theorems, and the relationship between proof complexity and Boolean circuit complexity.…

Condition: As New. Unread book in perfect condition.

Condition: New. In English.

Condition: New. In English.

Condition: New.

Condition: New.

Condition: New. Topics include transformations, lighting and shading, ray tracing, radiosity, texture mapping, colour theory, and aspects of animation. Num Pages: 396 pages, 186 b/w illus. 8 colour illus. 150 exercises. BIC Classification: PBM; UG. Category: (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 253 x 177 x 22. Weight in Grams: 868. . 2003. Illustrated. hardcover. . . . . …

Condition: New. Contains papers that represent the proceedings of the DIMACS workshop on 'Feasible Arithmetics and Proof Complexity' held in April 1996 at Rutgers University in New Jersey as part of the DIMACS Institute's Special Year on Logic and Algorithms. This book covers a number of aspects of the field, including lower bounds in proof complexity. Editor(s): Beame, Paul W.; Buss, Samuel R. Series: Series in Discrete Mathematics & Theoretical Computer Science. Num Pages: 320 pages. BIC Classification: PBCD; UFM; UYA. Category: (P) Professional & Vocational. Dimension: 211 x 262 x 22. Weight in Grams: 784. . 1997. hardcover. . . . . Books ship from the US and Ireland.…

Condition: As New. Unread book in perfect condition.

Hardback. Condition: New. This textbook, first published in 2003, emphasises the fundamentals and the mathematics underlying computer graphics. The minimal prerequisites, a basic knowledge of calculus and vectors plus some programming experience in C or C++, make the book suitable for self study or for use as an advanced undergraduate or introductory graduate text. The author gives a thorough treatment of transformations and viewing, lighting and shading models, interpolation and averaging, Bézier curves and B-splines, ray tracing and radiosity, and intersection testing with rays. Additional topics, covered in less depth, include texture mapping and colour theory. The book covers some aspects of animation, including quaternions, orientation, and inverse kinematics, and includes source code for a Ray Tracing software package. The book is intended for use along with any OpenGL programming book, but the crucial features of OpenGL are briefly covered to help readers get up to speed. Accompanying software is available freely from the book's web site.…

Condition: New. Topics include transformations, lighting and shading, ray tracing, radiosity, texture mapping, colour theory, and aspects of animation. Num Pages: 396 pages, 186 b/w illus. 8 colour illus. 150 exercises. BIC Classification: PBM; UG. Category: (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 253 x 177 x 22. Weight in Grams: 868. . 2003. Illustrated. hardcover. . . . . Books ship from the US and Ireland. …

Condition: New. Contains papers that represent the proceedings of the DIMACS workshop on 'Feasible Arithmetics and Proof Complexity' held in April 1996 at Rutgers University in New Jersey as part of the DIMACS Institute's Special Year on Logic and Algorithms. This book covers a number of aspects of the field, including lower bounds in proof complexity. Editor(s): Beame, Paul W.; Buss, Samuel R. Series: Series in Discrete Mathematics & Theoretical Computer Science. Num Pages: 320 pages. BIC Classification: PBCD; UFM; UYA. Category: (P) Professional & Vocational. Dimension: 211 x 262 x 22. Weight in Grams: 784. . 1997. hardcover. . . . .…

Hardback. Condition: New. Questions of mathematical proof and logical inference have been a significant thread in modern mathematics and have played a formative role in the development of computer science and artificial intelligence. Research in proof complexity and feasible theories of arithmetic aims at understanding not only whether logical inferences can be made, but also what resources are required to carry them out. Understanding the resources required for logical inferences has major implications for some of the most important problems in computational complexity, particularly the problem of whether NP is equal to co-NP. In addition, these have important implications for the efficiency of automated reasoning systems. The last dozen years have seen several breakthroughs in the study of these resource requirements.Papers in this volume represent the proceedings of the DIMACS workshop on 'Feasible Arithmetics and Proof Complexity' held in April 1996 at Rutgers University in New Jersey as part of the DIMACS Institute's Special Year on Logic and Algorithms. This book brings together some of the most recent work of leading researchers in proof complexity and feasible arithmetic reflecting many of these advances. It covers a number of aspects of the field, including lower bounds in proof complexity, witnessing theorems and proof systems for feasible arithmetic, algebraic and combinatorial proof systems, interpolation theorems, and the relationship between proof complexity and Boolean circuit complexity.…