Matches in SemOpenAlex for { <https://semopenalex.org/work/W2123540893> ?p ?o ?g. }
Showing items 1 to 85 of
85
with 100 items per page.
- W2123540893 abstract "The Boolean Decision tree model is perhaps the simplest model that computes Boolean functions; it charges only for reading an input variable. We study the power of randomness (vs. both determinism and non-determinism) in this model, and prove separation results between the three complexity measures. These results are obtained via general and efficient methods for computing upper and lower bounds on the probabilistic complexity of evaluating Boolean formulae in which every variable appears exactly once (AND/OR tree with distinct leaves). These bounds are shown to be exactly tight for interesting families of such tree functions. We then apply our results to the complexity of evaluating game trees, which is a central problem in AI. These trees are similar to Boolean tree functions, except that input variables (leaves) may take values from a large set (of valuations to game positions) and the AND/OR nodes are replaced by MIN/MAX nodes. Here the cost is the number of positions (leaves) probed by the algorithm. The best known algorithm for this problem is the alpha-beta pruning method. As a deterministic algorithm, it will in the worst case have to examine all positions. Many papers studied the expected behavior of alpha-beta pruning (on uniform trees) under the unreasonable assumption that position values are drawn independently from some distribution. We analyze a randomized variant of alphabeta pruning, show that it is considerably faster than the deterministic one in worst case, and prove it optimal for uniform trees." @default.
- W2123540893 created "2016-06-24" @default.
- W2123540893 creator A5030610930 @default.
- W2123540893 creator A5039043184 @default.
- W2123540893 date "1986-10-01" @default.
- W2123540893 modified "2023-09-30" @default.
- W2123540893 title "Probabilistic Boolean decision trees and the complexity of evaluating game trees" @default.
- W2123540893 cites W1966167835 @default.
- W2123540893 cites W1987842530 @default.
- W2123540893 cites W2016606569 @default.
- W2123540893 cites W2017359019 @default.
- W2123540893 cites W2023146810 @default.
- W2123540893 cites W2026325622 @default.
- W2123540893 cites W2065230093 @default.
- W2123540893 cites W2080620555 @default.
- W2123540893 cites W2085081875 @default.
- W2123540893 cites W2147862220 @default.
- W2123540893 cites W2157803532 @default.
- W2123540893 doi "https://doi.org/10.1109/sfcs.1986.44" @default.
- W2123540893 hasPublicationYear "1986" @default.
- W2123540893 type Work @default.
- W2123540893 sameAs 2123540893 @default.
- W2123540893 citedByCount "180" @default.
- W2123540893 countsByYear W21235408932012 @default.
- W2123540893 countsByYear W21235408932013 @default.
- W2123540893 countsByYear W21235408932014 @default.
- W2123540893 countsByYear W21235408932015 @default.
- W2123540893 countsByYear W21235408932016 @default.
- W2123540893 countsByYear W21235408932017 @default.
- W2123540893 countsByYear W21235408932018 @default.
- W2123540893 countsByYear W21235408932019 @default.
- W2123540893 countsByYear W21235408932020 @default.
- W2123540893 countsByYear W21235408932021 @default.
- W2123540893 countsByYear W21235408932022 @default.
- W2123540893 countsByYear W21235408932023 @default.
- W2123540893 crossrefType "proceedings-article" @default.
- W2123540893 hasAuthorship W2123540893A5030610930 @default.
- W2123540893 hasAuthorship W2123540893A5039043184 @default.
- W2123540893 hasConcept C105795698 @default.
- W2123540893 hasConcept C108010975 @default.
- W2123540893 hasConcept C111797529 @default.
- W2123540893 hasConcept C113174947 @default.
- W2123540893 hasConcept C11413529 @default.
- W2123540893 hasConcept C114614502 @default.
- W2123540893 hasConcept C118615104 @default.
- W2123540893 hasConcept C187455244 @default.
- W2123540893 hasConcept C311688 @default.
- W2123540893 hasConcept C33923547 @default.
- W2123540893 hasConcept C41008148 @default.
- W2123540893 hasConcept C49937458 @default.
- W2123540893 hasConcept C6557445 @default.
- W2123540893 hasConcept C7342684 @default.
- W2123540893 hasConcept C86803240 @default.
- W2123540893 hasConceptScore W2123540893C105795698 @default.
- W2123540893 hasConceptScore W2123540893C108010975 @default.
- W2123540893 hasConceptScore W2123540893C111797529 @default.
- W2123540893 hasConceptScore W2123540893C113174947 @default.
- W2123540893 hasConceptScore W2123540893C11413529 @default.
- W2123540893 hasConceptScore W2123540893C114614502 @default.
- W2123540893 hasConceptScore W2123540893C118615104 @default.
- W2123540893 hasConceptScore W2123540893C187455244 @default.
- W2123540893 hasConceptScore W2123540893C311688 @default.
- W2123540893 hasConceptScore W2123540893C33923547 @default.
- W2123540893 hasConceptScore W2123540893C41008148 @default.
- W2123540893 hasConceptScore W2123540893C49937458 @default.
- W2123540893 hasConceptScore W2123540893C6557445 @default.
- W2123540893 hasConceptScore W2123540893C7342684 @default.
- W2123540893 hasConceptScore W2123540893C86803240 @default.
- W2123540893 hasLocation W21235408931 @default.
- W2123540893 hasOpenAccess W2123540893 @default.
- W2123540893 hasPrimaryLocation W21235408931 @default.
- W2123540893 hasRelatedWork W143146503 @default.
- W2123540893 hasRelatedWork W1498612398 @default.
- W2123540893 hasRelatedWork W1601935780 @default.
- W2123540893 hasRelatedWork W1604438253 @default.
- W2123540893 hasRelatedWork W2014833376 @default.
- W2123540893 hasRelatedWork W2050201153 @default.
- W2123540893 hasRelatedWork W2212155158 @default.
- W2123540893 hasRelatedWork W2304492655 @default.
- W2123540893 hasRelatedWork W264823163 @default.
- W2123540893 hasRelatedWork W4252281389 @default.
- W2123540893 isParatext "false" @default.
- W2123540893 isRetracted "false" @default.
- W2123540893 magId "2123540893" @default.
- W2123540893 workType "article" @default.