0
Your cart

Your cart is empty

Browse All Departments
  • All Departments
Price
  • R2,500 - R5,000 (2)
  • -
Status
Brand

Showing 1 - 2 of 2 matches in All Departments

Algebraic Complexity Theory (Hardcover, 1997 ed.): Peter Burgisser Algebraic Complexity Theory (Hardcover, 1997 ed.)
Peter Burgisser; Assisted by T. Lickteig; Michael Clausen, Mohammad A. Shokrollahi
R3,854 Discovery Miles 38 540 Ships in 12 - 17 working days

This is the first book to present an up-to-date and self-contained account of Algebraic Complexity Theory that is both comprehensive and unified. Requiring of the reader only some basic algebra and offering over 350 exercises, it is well-suited as a textbook for beginners at graduate level. With its extensive bibliography covering about 500 research papers, this text is also an ideal reference book for the professional researcher. The subdivision of the contents into 21 more or less independent chapters enables readers to familiarize themselves quickly with a specific topic, and facilitates the use of this book as a basis for complementary courses in other areas such as computer algebra.

Algebraic Complexity Theory (Paperback, Softcover reprint of hardcover 1st ed. 1997): Peter Burgisser Algebraic Complexity Theory (Paperback, Softcover reprint of hardcover 1st ed. 1997)
Peter Burgisser; Assisted by T. Lickteig; Michael Clausen, Mohammad A. Shokrollahi
R4,091 Discovery Miles 40 910 Ships in 10 - 15 working days

The algorithmic solution of problems has always been one of the major concerns of mathematics. For a long time such solutions were based on an intuitive notion of algorithm. It is only in this century that metamathematical problems have led to the intensive search for a precise and sufficiently general formalization of the notions of computability and algorithm. In the 1930s, a number of quite different concepts for this purpose were pro posed, such as Turing machines, WHILE-programs, recursive functions, Markov algorithms, and Thue systems. All these concepts turned out to be equivalent, a fact summarized in Church's thesis, which says that the resulting definitions form an adequate formalization of the intuitive notion of computability. This had and continues to have an enormous effect. First of all, with these notions it has been possible to prove that various problems are algorithmically unsolvable. Among of group these undecidable problems are the halting problem, the word problem theory, the Post correspondence problem, and Hilbert's tenth problem. Secondly, concepts like Turing machines and WHILE-programs had a strong influence on the development of the first computers and programming languages. In the era of digital computers, the question of finding efficient solutions to algorithmically solvable problems has become increasingly important. In addition, the fact that some problems can be solved very efficiently, while others seem to defy all attempts to find an efficient solution, has called for a deeper under standing of the intrinsic computational difficulty of problems."

Free Delivery
Pinterest Twitter Facebook Google+
You may like...
XXdreamSToys Bondage Tape (20m)(Black)
R199 R99 Discovery Miles 990
Baby Dove Shampoo Rich Moisture 200ml
R50 Discovery Miles 500
Rogz Lounge Walled Oval Pet Bed (Navy…
R625 Discovery Miles 6 250
Sterile Wound Dressing
R5 Discovery Miles 50
Baby Dove Rich Moisture Wipes (50Wipes)
R40 Discovery Miles 400
The Papery A5 MOM 2025 Diary - Lady Bugs
R349 R300 Discovery Miles 3 000
Lucky Plastic 3-in-1 Nose Ear Trimmer…
R289 Discovery Miles 2 890
King Of Greed - Kings Of Sin: Book 3
Ana Huang Paperback R280 R140 Discovery Miles 1 400
Bostik Glue Stick (40g)
R52 Discovery Miles 520
Home Classix Placemats - The Tropics…
R59 R51 Discovery Miles 510

 

Partners