<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>http://wiki.karljones.com/index.php?action=history&amp;feed=atom&amp;title=Decision_tree_model</id>
		<title>Decision tree model - Revision history</title>
		<link rel="self" type="application/atom+xml" href="http://wiki.karljones.com/index.php?action=history&amp;feed=atom&amp;title=Decision_tree_model"/>
		<link rel="alternate" type="text/html" href="http://wiki.karljones.com/index.php?title=Decision_tree_model&amp;action=history"/>
		<updated>2026-10-23T15:07:06Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.24.2</generator>

	<entry>
		<id>http://wiki.karljones.com/index.php?title=Decision_tree_model&amp;diff=19831&amp;oldid=prev</id>
		<title>Karl Jones: Created page with &quot;In computational complexity and communication complexity theories, the '''decision tree model''' is the model of computation or com...&quot;</title>
		<link rel="alternate" type="text/html" href="http://wiki.karljones.com/index.php?title=Decision_tree_model&amp;diff=19831&amp;oldid=prev"/>
				<updated>2016-12-06T20:52:25Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot;In &lt;a href=&quot;/index.php/Computational_complexity_theory&quot; title=&quot;Computational complexity theory&quot;&gt;computational complexity&lt;/a&gt; and &lt;a href=&quot;/index.php?title=Communication_complexity&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;Communication complexity (page does not exist)&quot;&gt;communication complexity&lt;/a&gt; theories, the &amp;#039;&amp;#039;&amp;#039;decision tree model&amp;#039;&amp;#039;&amp;#039; is the &lt;a href=&quot;/index.php/Model_of_computation&quot; title=&quot;Model of computation&quot;&gt;model of computation&lt;/a&gt; or com...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;In [[Computational complexity theory|computational complexity]] and [[communication complexity]] theories, the '''decision tree model''' is the [[model of computation]] or communication in which an [[algorithm]] or communication process is considered to be basically a [[decision tree]], i.e., a sequence of branching operations based on comparisons of some quantities, the comparisons being assigned the unit computational cost.&lt;br /&gt;
&lt;br /&gt;
The branching operations are called &amp;quot;tests&amp;quot; or &amp;quot;queries&amp;quot;. In this setting the algorithm in question may be viewed as a computation of a Boolean function, where the input is a series of queries and the output is the final decision. Every query is dependent on previous queries.&lt;br /&gt;
&lt;br /&gt;
Several variants of decision tree models have been introduced, depending on the complexity of the operations allowed in the computation of a single comparison and the way of branching.&lt;br /&gt;
&lt;br /&gt;
Decision trees models are instrumental in establishing lower bounds for computational complexity for certain classes of computational problems and algorithms: the lower bound for worst-case computational complexity is proportional to the largest depth among the decision trees for all possible inputs for a given computational problem. &lt;br /&gt;
&lt;br /&gt;
he computation complexity of a problem or an algorithm expressed in terms of the decision tree model is called decision tree complexity or query complexity.&lt;br /&gt;
&lt;br /&gt;
== See also ==&lt;br /&gt;
&lt;br /&gt;
* [[Analysis of algorithms]]&lt;br /&gt;
* [[Communication complexity]]&lt;br /&gt;
* [[Computational complexity theory]]&lt;br /&gt;
* [[Decision tree]]&lt;br /&gt;
* [[Minimum spanning tree]]&lt;br /&gt;
&lt;br /&gt;
== External links ==&lt;br /&gt;
&lt;br /&gt;
* [https://en.wikipedia.org/wiki/Decision_tree_model Decision tree model] @ Wikipedia&lt;br /&gt;
&lt;br /&gt;
[[Category:Complexity]]&lt;br /&gt;
[[Category:Computation]]&lt;/div&gt;</summary>
		<author><name>Karl Jones</name></author>	</entry>

	</feed>