Computation Trees
A Generalization of Decision Trees
Series: Intelligent Systems Reference Library; 275;
- Publisher's listprice EUR 160.49
-
66 563 Ft (63 393 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 20% (cc. 13 313 Ft off)
- Discounted price 53 250 Ft (50 714 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
66 563 Ft
Availability
printed on demand
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher Springer Nature Switzerland
- Date of Publication 20 August 2025
- Number of Volumes 1 pieces, Book
- ISBN 9783031917479
- Binding Hardback
- No. of pages165 pages
- Size 235x155 mm
- Language English
- Illustrations XII, 165 p. 5 illus. Illustrations, black & white 688
Categories
Long description:
This book is devoted to the study of deterministic and nondeterministic computation trees. Computation trees are a natural generalization of decision trees: in addition to the one-place predicate-type operations (attributes) used in decision trees, computation trees can use multi-place predicate and function operations. They arise both where we deal with algorithms for solving problems of combinatorial optimization, computational geometry, etc., and where we solve classification or prediction problems, especially if we use combinations of input variables as attributes. This book mainly studies the complexity of computation trees and also examines related optimization problems. The results discussed in this book may be useful to researchers studying algorithms and using algorithm models similar to computation trees. These results may also be useful to researchers working with decision trees and decision rule systems in data analysis, particularly, in rough set theory, logical analysis of data, and test theory. The book is also used to create graduate courses.
MoreTable of Contents:
Introduction.- Computation Trees Over Predicate Structures. Local Approach.- Computation Trees Over Predicate Structures. Global Approach.- Rough Analysis of Computation Trees.- Algorithmic Problems for Computation Trees.- Programs Versus Finite Tree-Programs.
More
Exploitation of Seismograph Networks
35 481 HUF
31 224 HUF
Methods and Methodologies: Aristotelian Logic East and West, 500-1500
59 309 HUF
54 565 HUF
Mapping Metaphorical Discourse in the Fourth Gospel: John’s Eternal King
77 558 HUF
71 354 HUF
