Order Total (1 Item Items):
Shipping Destination:
Chee Yap (330 results)
Author:
chee yap
Refine with Advanced Search
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (330)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (301)
- As New, Fine or Near Fine (19)
- Very Good or Good (5)
- Fair or Poor (No further results match this refinement)
- As Described (5)
Collectible Attributes
- First Edition (5)
- Signed (No further results match this refinement)
- Dust Jacket (1)
- Seller-Supplied Images (108)
- Not Print on Demand (144)
Language (8)
Free Shipping
Seller Location
Seller Rating
-
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
A Double Exponential Lower Bound for Degree-Compatible Gr?bner Bases (Classic Reprint)
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
Coordinating the Motion of Several Discs Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
A New Lower Bound Construction for the Word Problem for Commutative Thue Systems Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 4 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
An On Log N Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments Preliminary Version Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 4 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
How to Move a Chair Through a Door Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
Fundamental Problems of Algorithmic Algebra
Language: English
Published by Oxford University Press, 1999
ISBN 10: 0195125169 ISBN 13: 9780195125160
Hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
-
Fundamental Problems of Algorithmic Algebra
Language: English
Published by Oxford University Press, 1999
ISBN 10: 0195125169 ISBN 13: 9780195125160
Hardcover. Condition: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.
-
Fundamental Problems of Algorithmic Algebra
Language: English
Published by Oxford University Press, 2000
ISBN 10: 0195125169 ISBN 13: 9780195125160
First Edition
Hardcover. Condition: Fine. 1st Edition. First Edition. 9.5 x 7.75 in. xv, 511 pp. Glossy illustrated boards. No internal markings, faint shelf-wear. Near Fine.
-
Paperback. Condition: Brand New. 168 pages. 8.27x8.27x0.38 inches. In Stock.
-
Fundamental Problems of Algorithmic Algebra
Language: English
Published by Oxford University Press, 1999
ISBN 10: 0195125169 ISBN 13: 9780195125160
Seller: Isaiah Thomas Books & Prints, Inc., Cotuit, MA, U.S.A.
Association Member: ABAA ILAB SNEAB
Seller rating 2 out of 5 stars
Hardcover. Condition: Very Good. Used like new. White glazed boards. ; 9.6 X 7.9 X 1.4 inches; 528 pages.
-
Fundamental Problems of Algorithmic Algebra
Language: English
Published by Oxford University Press, NY, 2000
ISBN 10: 0195125169 ISBN 13: 9780195125160
First Edition
Hardcover. Condition: Very Fine. First Edition. No markings.
-
Fundamental Problems of Algorithmic Algebra
Language: English
Published by Oxford University Press, 1999
ISBN 10: 0195125169 ISBN 13: 9780195125160
hardcover. Condition: New.
-
Algorithmic and Geometric Aspects of Robotics. Advances in Robotics Volume 1.
Language: English
Published by New Jersey & London: Lawrence Erlbaum Associates, 1987
ISBN 10: 0898595541 ISBN 13: 9780898595543
Seller: David Ford Books PBFA, Cley-next-the-Sea, United Kingdom
Association Member: PBFA
Seller rating 5 out of 5 stars
First Edition
Condition: very good. First edition, first impression. Hardcover book. Laminated boards. 305pp. With figures and diagrams in texts throughout. Seven sections by various authors, including : The Challenge of Robotics for Computer Science; Computational Geometry; Algorithmic Motion PLanning; Intersection and Proximity Problems and Voronoi Diagrams.This copy appears to have belonged to a UK company's technical library from the address stamp to flyleaf, and a pen number added to top front cover: otherwise very good condition, with light spotting/browning to closed page edges, light mark to back cover. Pictures available.
-
Condition: As New. Unread book in perfect condition.
-
Fundamental Problems of Algorithmic Algebra
Language: English
Published by Oxford University Press, 1999
ISBN 10: 0195125169 ISBN 13: 9780195125160
Seller: George Cross Books, Lexington, MA, U.S.A.
Association Member: IOBA
Seller rating 4 out of 5 stars
First Edition
Hardcover. First edition. New/No Jacket (21681) First edition. No jacket, as issued. New book from publisher, NOT a remainder. Clean, tight, unmarked, unused. .
-
Condition: New. pp. 321.
-
Condition: New.
-
-
-
Condition: New. pp. 321.
-
Paperback. Condition: New. Print on Demand. This book presents a theoretical construction that provides a quantitative lower bound for the degree of Grobner bases, a class of sets used to solve systems of polynomial equations. The author's method hinges on Thue systems, a type of formal grammar used to model computation. By establishing a connection between the two, the author demonstrates that Grobner bases can have a high degree of complexity, specifically a double-exponential relationship with the number of variables in the underlying system. This insight contributes to the ongoing research on Grobner bases and their computational limits, advancing our understanding of these essential tools in polynomial algebra. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.
-
Paperback. Condition: New. Print on Demand. This book presents a framework for understanding the notion of concavity in rectilinear regions, exemplified by rectangular shapes. The author develops a combinatorial definition of concavity, which is then used to categorize different levels of concavity, including the familiar notion of convexity. The book investigates the problem of finding the largest rectilinear convex region within a given rectilinear region, presenting an efficient algorithm for solving this problem. The author also explores related problems, such as finding the largest convex region with specific properties, providing valuable insights into the nature and properties of rectilinear shapes. This book will appeal to mathematicians and computer scientists interested in computational geometry and the analysis of geometric shapes. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.
-
Paperback. Condition: New. Print on Demand. This book leverages the retraction method to develop efficient algorithms for coordinating motion among multiple discs in the presence of obstacles. The retraction approach simplifies the complex problem of coordinating multiple discs by decomposing it into a series of elementary motions and discontinuities, leading to a significant reduction in the number of steps required to find a coordinated motion. This approach has proven superior to previous decomposition-based methods, demonstrating its effectiveness in optimizing motion planning. The book explores the inherent complexity of coordinating multiple discs and presents a comprehensive analysis of elementary motions and discontinuities, resulting in the development of a canonical coordinated motion graph. This graph serves as a powerful tool for searching and finding coordinated motions, providing a systematic approach to solving this challenging problem. The author's insights offer valuable contributions to the field of motion planning, paving the way for further advancements in this domain. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.
-
Paperback. Condition: New. Print on Demand. This book investigates a family of polynomial sequences known as polynomial remainder sequences. The concept of a polynomial remainder sequence is rooted in ancient mathematics and has applications in diverse fields like elimination theory, Diophantine equations, and algebraic cell decomposition. The author explores the theoretical underpinnings of these sequences and introduces a new algorithm for computing them. The book also presents a detailed examination of the theory of subresultants, which are intimately connected with polynomial remainder sequences and provide important insights into their structure and behavior. Through this exploration, the author unveils the intricate relationship between subresultants and the Euclidean polynomial remainder sequence, offering a deeper understanding of these fundamental mathematical constructs. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.
-
Paperback. Condition: New. Print on Demand. This book offers novel insights into the theoretical limits of computer science's ability to solve a fundamental problem: understanding and manipulating symbolic expressions. At the heart of this research lies an intricately constructed mathematical system that challenges the capabilities of algorithms to represent and analyze data. The author meticulously explores the interplay between mathematical theory and algorithmic complexity, delving into concepts like commutative Thue systems and their relation to polynomial ideals. Through these investigations, the book sheds light on the inherent computational difficulty of solving symbolic problems, providing valuable theoretical frameworks and benchmarks for future research in computer science and related fields. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.
