<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://debianws.lexgopc.com/wiki143/index.php?action=history&amp;feed=atom&amp;title=Algorithmic_complexity</id>
	<title>Algorithmic complexity - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://debianws.lexgopc.com/wiki143/index.php?action=history&amp;feed=atom&amp;title=Algorithmic_complexity"/>
	<link rel="alternate" type="text/html" href="http://debianws.lexgopc.com/wiki143/index.php?title=Algorithmic_complexity&amp;action=history"/>
	<updated>2026-05-09T03:23:59Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.1</generator>
	<entry>
		<id>http://debianws.lexgopc.com/wiki143/index.php?title=Algorithmic_complexity&amp;diff=252216&amp;oldid=prev</id>
		<title>imported&gt;ClueBot NG: Reverting possible vandalism by 106.51.74.137 to version by Crashed greek. Report False Positive? Thanks, ClueBot NG. (4292152) (Bot)</title>
		<link rel="alternate" type="text/html" href="http://debianws.lexgopc.com/wiki143/index.php?title=Algorithmic_complexity&amp;diff=252216&amp;oldid=prev"/>
		<updated>2023-12-26T09:10:34Z</updated>

		<summary type="html">&lt;p&gt;Reverting possible vandalism by &lt;a href=&quot;/wiki143/index.php?title=Special:Contributions/106.51.74.137&quot; title=&quot;Special:Contributions/106.51.74.137&quot;&gt;106.51.74.137&lt;/a&gt; to version by Crashed greek. &lt;a href=&quot;/wiki143/index.php?title=WP:CBFP&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;WP:CBFP (page does not exist)&quot;&gt;Report False Positive?&lt;/a&gt; Thanks, &lt;a href=&quot;/wiki143/index.php?title=WP:CBNG&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;WP:CBNG (page does not exist)&quot;&gt;ClueBot NG&lt;/a&gt;. (4292152) (Bot)&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&amp;#039;&amp;#039;&amp;#039;Algorithmic complexity&amp;#039;&amp;#039;&amp;#039; may refer to:&lt;br /&gt;
* In [[algorithmic information theory]], the complexity of a particular string in terms of all algorithms that generate it.&lt;br /&gt;
** [[Kolmogorov complexity|Solomonoff–Kolmogorov–Chaitin complexity]], the most widely used such measure.&lt;br /&gt;
* In [[computational complexity theory]], although it would be a non-formal usage of the term, the time/space complexity of a particular problem in terms of all algorithms that solve it with computational resources (i.e., time or space) bounded by a function of the input&amp;#039;s size.&lt;br /&gt;
** Or it may refer to the time/space complexity of a particular algorithm with respect to solving a particular problem (as above), which is a notion commonly found in [[analysis of algorithms]].&lt;br /&gt;
**[[Time complexity]] is the amount of computer time it takes to run an algorithm.&lt;br /&gt;
&lt;br /&gt;
{{disambiguation}}&lt;/div&gt;</summary>
		<author><name>imported&gt;ClueBot NG</name></author>
	</entry>
</feed>