A New Lower Bound Construction for the Word Problem for Commutative Thue Systems Classic Reprint
Chee K. Yap
ISBN 10: 1334215324 ISBN 13: 9781334215322
Published by Forgotten Books, 2018
New
PAP
From
PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
AbeBooks Seller since April 7, 2005
This specific item is no longer available.
About this Item
Description:
New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781334215322
Synopsis:
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.
"About this title" may belong to another edition of this title.
Bibliographic Details
Title: A New Lower Bound Construction for the Word ...
Publisher: Forgotten Books
Publication Date: 2018
Binding: PAP
Condition: New
Top Search Results from the AbeBooks Marketplace
A New Lower Bound Construction for the Word Problem for Commutative Thue
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 5 out of 5 stars
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. Seller Inventory # 9781334215322_0
Buy New
US$ 17.22
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
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 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781334215322
Buy New
US$ 23.73
US$ 4.41 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 15 available