oldid |
date/time |
username |
edit summary
|
953800850 |
2020-04-29T03:20:38Z |
2601:C6:C480:2FE0:38B7:7BFA:3FAC:7E99 |
/* Separations between other complexity classes */ Explained clearly why NP not = co-NP implies NP not = P, because P = co-P.
|
950677123 |
2020-04-13T08:57:14Z |
OAbot |
[[Wikipedia:OABOT|Open access bot]]: doi added to citation with #oabot.
|
948949269 |
2020-04-03T21:54:56Z |
Citation bot |
Add: bibcode. | You can [[WP:UCB|use this bot]] yourself. [[WP:DBUG|Report bugs here]]. | Activated by Zppix | [[Category:Computational fields of study]] | via #UCB_Category
|
947910594 |
2020-03-29T04:04:40Z |
Wylie39 |
Reverted edits by [[Special:Contribs/92.6.7.172|92.6.7.172]] ([[User talk:92.6.7.172|talk]]) to last version by Mccapra
|
947910583 |
2020-03-29T04:04:35Z |
92.6.7.172 |
|
947098017 |
2020-03-24T08:43:26Z |
Mccapra |
/* See also */ Adding link to orphaned article, Wikiproject Orphanage: [[Wikipedia:ORPHAN|You can help!]]
|
942991272 |
2020-02-28T04:23:10Z |
Retimuko |
Undid revision 942981143 by [[Special:Contributions/Rebecca hoysted|Rebecca hoysted]] ([[User talk:Rebecca hoysted|talk]]) rvv
|
942981143 |
2020-02-28T02:41:14Z |
Rebecca hoysted |
/* Computational problems */Love is it but only endless but never to end if it is true.
|
942897939 |
2020-02-27T15:32:40Z |
Kleuske |
Reverted edits by [[Special:Contribs/Rebecca hoysted|Rebecca hoysted]] ([[User talk:Rebecca hoysted|talk]]) to last version by Materialscientist
|
942897877 |
2020-02-27T15:32:13Z |
Rebecca hoysted |
Thery of my mind
|
942897361 |
2020-02-27T15:28:14Z |
Materialscientist |
Reverted 1 edit by [[Special:Contributions/49.199.39.247|49.199.39.247]] identified as test/vandalism using [[WP:STiki|STiki]]
|
942897135 |
2020-02-27T15:26:27Z |
49.199.39.247 |
My thoughts
|
940572006 |
2020-02-13T09:16:33Z |
Selfawareai |
added aaronson's essay on computational complexity
|
937486434 |
2020-01-25T09:48:22Z |
D.Lazard |
/* top */ Shorter and less repetition of article title
|
937472741 |
2020-01-25T07:06:58Z |
Retimuko |
rvv
|
937472580 |
2020-01-25T07:04:34Z |
169.0.249.201 |
|
937472535 |
2020-01-25T07:03:52Z |
169.0.249.201 |
|
934968045 |
2020-01-09T16:47:07Z |
Shalevku |
/* Defining complexity classes */ grammer - singular because plural is in parentheses
|
931444479 |
2019-12-18T23:11:48Z |
InternetArchiveBot |
Bluelinking 1 books for [[WP:V|verifiability]].) #IABot (v2.1alpha3
|
921162597 |
2019-10-14T08:34:36Z |
D.Lazard |
Reverted 1 edit by [[Special:Contributions/AntPraxis|AntPraxis]] ([[User talk:AntPraxis|talk]]): Wrong change ([[WP:TW|TW]])
|
921160190 |
2019-10-14T08:15:12Z |
AntPraxis |
Chagned "computational complexity theory" to "computability theory"
|
919500481 |
2019-10-04T02:06:40Z |
Logan |
clean up citations | Add: doi, year, class, title, bibcode, pages, volume, author pars. 1-2. Removed URL that duplicated unique identifier. Formatted [[WP:ENDASH|dashes]]. | You can [[WP:UCB|use this tool]] yourself. [[WP:DBUG|Report bugs here]].
|
919171479 |
2019-10-02T06:51:10Z |
Pulkitism4215 |
|
916096171 |
2019-09-17T00:19:25Z |
Monkbot |
/* P versus NP problem */[[User:Monkbot/task 16: remove replace deprecated dead-url params|Task 16]]: replaced (1×) / removed (0×) deprecated |dead-url= and |deadurl= with |url-status=;
|
914629605 |
2019-09-08T13:42:30Z |
InternetArchiveBot |
Bluelinking 1 books for [[WP:V|verifiability]].) #IABot (v2.1alpha3
|
911699260 |
2019-08-20T15:24:17Z |
2620:10D:C091:500:0:0:3:3898 |
/* History */
|
910253833 |
2019-08-10T19:22:05Z |
Bender235 |
|
909022420 |
2019-08-02T14:51:46Z |
Jarble |
adding links to references using [[Google Scholar]]
|
907640046 |
2019-07-24T08:33:52Z |
Tyilo |
/* Important complexity classes */ Add missing O's
|
900603613 |
2019-06-06T16:16:31Z |
User-duck |
Eliminate px from thumbs. Fix cite.
|
900250033 |
2019-06-04T12:16:27Z |
Retro |
Re-added Continuous complexity theory section, since it was removed without explanation [[Special:Diff/566407465|here]].
|
897745581 |
2019-05-19T02:35:43Z |
Izno |
might be time for bed...
|
897745480 |
2019-05-19T02:34:18Z |
IznoRepeat |
cleaning (ed[s])--template now always displays editor annotation; gen fixes
|
897742508 |
2019-05-19T01:58:33Z |
36.11.225.20 |
Link
|
897359819 |
2019-05-16T14:27:42Z |
Colonies Chris |
/* Textbooks */ minor fixes
|
892644972 |
2019-04-15T23:01:37Z |
Jamgoodman |
/* See also */ * [[Computational complexity of mathematical operations]]
|
891134245 |
2019-04-05T22:03:30Z |
Mark viking |
Changing [[Wikipedia:Short description|short description]] from "computer science theory that classifies problems according to their inherent difficulty" to "Theory classifying computational problems by their inherent difficulty" ([[User:Galobtter/Shortdesc helper|Shortdesc helper]])
|
889655592 |
2019-03-27T02:50:49Z |
PaulKeeperson |
Reverted 1 edit by [[Special:Contributions/2409:4070:2189:8EE:C0A8:A028:92E:E66E|2409:4070:2189:8EE:C0A8:A028:92E:E66E]] ([[User talk:2409:4070:2189:8EE:C0A8:A028:92E:E66E|talk]]) to last revision by Neutronstar2 ([[WP:TW|TW]])
|
889655512 |
2019-03-27T02:50:03Z |
2409:4070:2189:8EE:C0A8:A028:92E:E66E |
/* Intractability */Hello madam e
|
884844086 |
2019-02-24T10:56:22Z |
Neutronstar2 |
/* Problems in NP not known to be in P or NP-complete */
|
884837603 |
2019-02-24T09:44:45Z |
Neutronstar2 |
/* Problems in NP not known to be in P or NP-complete */ compact representation of Big O notation
|
884218963 |
2019-02-20T07:38:24Z |
ConceptuallyComplex |
The statement about NP/=/ conp, so it is clear p\=\np because if p=NP , p = conp because it is its dual... This is a failure of understanding classification. If the above logic held, then necessarily its proven p /=/np, through contradiction.
|
883172810 |
2019-02-13T18:50:23Z |
Citation bot |
Alter: template type. Add: series, isbn. | You can [[WP:UCB|use this bot]] yourself. [[WP:DBUG|Report bugs here]]. | [[WP:UCB|User-activated]].
|
881050497 |
2019-01-31T03:28:24Z |
Bzorro |
/* Intractability */
|
881049866 |
2019-01-31T03:22:01Z |
Bzorro |
/* Intractability */
|
878990866 |
2019-01-18T07:39:46Z |
DokReggar |
Undid revision 878950566 by [[Special:Contributions/2607:F140:400:A02C:D176:AF49:3299:DC2E|2607:F140:400:A02C:D176:AF49:3299:DC2E]] ([[User talk:2607:F140:400:A02C:D176:AF49:3299:DC2E|talk]]) [[Help:Reverting|Reverting]] unexplained content removal
|
878950566 |
2019-01-18T00:05:15Z |
2607:F140:400:A02C:D176:AF49:3299:DC2E |
/* Decision problems as formal languages */ actually technically incorrect usage of or not (removed entirely)
|
878950185 |
2019-01-18T00:02:11Z |
2607:F140:400:A02C:D176:AF49:3299:DC2E |
/* Decision problems as formal languages */ no comma needed; dependent clause
|
875658903 |
2018-12-28T04:00:10Z |
HowardBGolden |
Correct spelling of Millennium
|
872395128 |
2018-12-07T01:13:01Z |
Smasongarrison |
copy edit with [[Wikipedia:AutoWikiBrowser/General_fixes|General fixes]]; url trimming of identifying info per[[WP:LINKSTOAVOID]] and [[Template:Citation_Style_documentation#url|Citation Style]]
|
871633465 |
2018-12-02T12:40:23Z |
Nomen4Omen |
/* Best, worst and average case complexity */ added Amortized + hierarchy
|
871171161 |
2018-11-29T11:50:24Z |
2A02:AA10:6280:980:89D3:6145:495D:4E21 |
|
871169679 |
2018-11-29T11:32:38Z |
2A02:AA10:6280:980:89D3:6145:495D:4E21 |
Only 14 cities are marked. Dortmund is missing. See: https://en.wikipedia.org/wiki/List_of_cities_in_Germany_by_population
|
868630989 |
2018-11-13T13:19:26Z |
2001:569:7181:4C00:2464:2567:4CC7:F0AC |
summarize first paragraph in clear and concise way to increase clarity
|
868630874 |
2018-11-13T13:18:14Z |
2001:569:7181:4C00:2464:2567:4CC7:F0AC |
summarize first paragraph in clear and concise way to increase clarity
|
860165613 |
2018-09-18T19:26:27Z |
An Autist |
Fix typo in Big-O Notation Formula
|
857010372 |
2018-08-28T23:55:19Z |
Mark viking |
Adding local [[Wikipedia:Short description|short description]]: "computer science theory that classifies problems according to their inherent difficulty" ([[User:Galobtter/Shortdesc helper|Shortdesc helper]])
|
855879935 |
2018-08-21T12:55:08Z |
Citation bot |
Alter: journal, isbn, title, pages. Add: title-link, citeseerx. Removed parameters. Formatted [[WP:ENDASH|dashes]]. You can [[WP:UCB|use this bot]] yourself. [[WP:DBUG|Report bugs here]].
|
854315940 |
2018-08-10T12:49:41Z |
Tea2min |
/* top */ Minor rewording. Of course, feel free to revert if you prefer the previous version.
|
854315603 |
2018-08-10T12:46:01Z |
Tea2min |
/* top */ Try to make link to [[computational complexity]] more explicit/more obvious.
|
854018598 |
2018-08-08T12:09:58Z |
DokReggar |
[[Help:Reverting|Reverting]] [[Wikipedia:Vandalism|vandalism]] or test edit
|
854008316 |
2018-08-08T10:12:18Z |
197.248.132.214 |
|
854008278 |
2018-08-08T10:11:52Z |
197.248.132.214 |
|
854008221 |
2018-08-08T10:11:18Z |
197.248.132.214 |
|
849030701 |
2018-07-06T01:07:35Z |
StanLeeP |
Reference
|
849030559 |
2018-07-06T01:06:09Z |
StanLeeP |
|
849030461 |
2018-07-06T01:05:00Z |
StanLeeP |
Ref & P NP problem
|
848632407 |
2018-07-03T06:44:02Z |
D.Lazard |
/* History */ Wolfram's opinion is not the opinion of the scientific community
|
848587400 |
2018-07-02T22:27:36Z |
Nikevcowsky |
/* History */
|
848212018 |
2018-06-30T13:31:43Z |
D.Lazard |
/* Function problems */ per[[MOS|EMDASH]]
|
848209936 |
2018-06-30T13:14:17Z |
DragonflySixtyseven |
/* Function problems */
|
845176067 |
2018-06-09T23:37:27Z |
Retimuko |
Undid revision 845174360 by [[Special:Contributions/184.102.113.83|184.102.113.83]] ([[User talk:184.102.113.83|talk]])
|
845174360 |
2018-06-09T23:17:41Z |
184.102.113.83 |
|
842402282 |
2018-05-22T06:34:55Z |
RobinK |
/* Problem instances */ added some clarification
|
842352459 |
2018-05-21T22:11:54Z |
Miracle173 |
Undid revision 841943711 by [[Special:Contributions/69.172.150.202|69.172.150.202]] ([[User talk:69.172.150.202|talk]])
|
841943711 |
2018-05-19T03:53:28Z |
69.172.150.202 |
/* Measuring the size of an instance */Measuring the size of the instance "in bits" is a misleading and unfounded generalization. The same paragraph goes on to give an example where the size is measured on the number of vertices (not the number of bits needed to represent the number of vertices).
|
838340120 |
2018-04-26T11:46:24Z |
ThatGuyCalledChris |
A minor edit to account for the fact that the thesis is merely arguing that this perspective is viable, it does not rigorously prove any fact.
|
837999241 |
2018-04-24T09:24:50Z |
D.Lazard |
Reverted 1 edit by [[Special:Contributions/137.59.66.182|137.59.66.182]] ([[User talk:137.59.66.182|talk]]) to last revision by Tea2min. ([[WP:TW|TW]])
|
837998547 |
2018-04-24T09:16:42Z |
137.59.66.182 |
/* Reduction */
|
837182663 |
2018-04-19T06:50:45Z |
Tea2min |
/* History */ Try to make link more obvious.
|
837091553 |
2018-04-18T17:20:02Z |
Ryugecin |
/* History */
|
836050840 |
2018-04-12T11:41:36Z |
Gronk Oz |
/* History */clean up, [[WP:AWB/T|typo(s) fixed]]: 1980's → 1980s (2) using [[Project:AWB|AWB]]
|
834255787 |
2018-04-04T19:01:05Z |
Floridada |
/* History */ Added minor notation about the theory in the 1980's
|
828231299 |
2018-03-01T09:37:35Z |
D.Lazard |
/* top */ link to [[computational complexity]]
|
825532186 |
2018-02-13T22:55:11Z |
CBM |
/* Turing machine */ c/e
|
824545028 |
2018-02-08T00:15:49Z |
Mhilferink |
/* Upper and lower bounds on the complexity of problems */
|
823781303 |
2018-02-03T10:39:38Z |
Jarble |
adding a link using [[Google Scholar]]
|
821940925 |
2018-01-23T14:19:26Z |
Allforrous |
/* External links */ Commonscat template.
|
821486253 |
2018-01-20T19:52:32Z |
Nalgene123 |
/* Reduction */
|
821236213 |
2018-01-19T05:41:20Z |
TAnthony |
/* See also */Update unknown or deprecated parameters in {{div col}} and {{reflist}}, which are now responsive with a default of 30em, and genfixes using [[Project:AWB|AWB]]
|
820471950 |
2018-01-14T22:27:28Z |
Ira Leviton |
Deleted 'of course'. Please see [[Wikipedia:Manual_of_Style#Instructional_and_presumptuous_language]], which cautions against use of this term.
|
820394022 |
2018-01-14T13:50:24Z |
InternetArchiveBot |
Rescuing 1 sources and tagging 0 as dead. #IABot (v1.6.2) ([[User:Balon Greyjoy|Balon Greyjoy]])
|
811980244 |
2017-11-25T05:15:20Z |
Citation bot |
Alter: last1, first1, issue. Add: class, isbn, year, series. You can [[WP:UCB|use this bot]] yourself. [[WP:DBUG|Report bugs here]].
|
811359244 |
2017-11-21T03:21:57Z |
Philip Trueman |
Reverted edits by [[Special:Contribs/128.84.126.210|128.84.126.210]] ([[User talk:128.84.126.210|talk]]) to last version by Headbomb
|
811338212 |
2017-11-21T00:15:08Z |
128.84.126.210 |
|
809812698 |
2017-11-11T16:08:16Z |
Headbomb |
fix
|
806848049 |
2017-10-24T14:50:31Z |
Steelgraham |
Added free to read links in citations with [[WP:OABOT|OAbot]] #oabot
|
802779491 |
2017-09-28T12:27:45Z |
Tony1 |
[[User:Ohconfucius/script|Script]]-assisted fixes: per [[MOS:NUM]], [[MOS:CAPS]], [[MOS:LINK]], [[User:Ohconfucius/script|Script]]-assisted fixes: per [[MOS:NUM]], [[MOS:CAPS]], [[MOS:LINK]]
|
801330887 |
2017-09-19T01:37:48Z |
211.27.238.182 |
|
797835290 |
2017-08-29T12:55:54Z |
Rjwilmsi |
Journal cites:, using [[Project:AWB|AWB]] (12158)
|
797642055 |
2017-08-28T11:24:47Z |
KolbertBot |
Bot: [[Wikipedia:Bots/Requests for approval/KolbertBot|HTTP→HTTPS]]
|
796493911 |
2017-08-21T06:37:07Z |
DokReggar |
fixed typo
|
796478087 |
2017-08-21T03:20:34Z |
Nbarth |
More balanced definition: not exactly PTIME
|
796476713 |
2017-08-21T03:05:52Z |
Nbarth |
tractable vs. feasible
|
796072984 |
2017-08-18T08:51:42Z |
Ale2006 |
/* Best, worst and average case complexity */ s/Theta/O/ in the caption, for consistency with text
|
794293291 |
2017-08-07T02:56:38Z |
Ad2004 |
/* Problems in NP not known to be in P or NP-complete */ Added mention of Babai's recent work on the graph isomorphism algorithm
|
793302459 |
2017-07-31T22:23:03Z |
Tudor987 |
|
792608093 |
2017-07-27T14:41:03Z |
Onel5969 |
Disambiguating links to [[Complexity measure]] (link changed to [[Complexity]]) using [[User:Qwertyytrewqqwerty/DisamAssist|DisamAssist]].
|
787096124 |
2017-06-23T11:45:44Z |
2601:1C0:102:29D8:CC06:F9E1:52DD:1E95 |
Undid revision 787093135 by [[Special:Contributions/62.28.232.202|62.28.232.202]] ([[User talk:62.28.232.202|talk]])
|
787093135 |
2017-06-23T11:14:35Z |
62.28.232.202 |
/* Defining complexity classes */
|
787092496 |
2017-06-23T11:08:09Z |
ClueBot NG |
Reverting possible vandalism by [[Special:Contribs/62.28.232.202|62.28.232.202]] to version by Tea2min. [[WP:CBFP|Report False Positive?]] Thanks, [[WP:CBNG|ClueBot NG]]. (3070783) (Bot)
|
787092491 |
2017-06-23T11:08:05Z |
62.28.232.202 |
/* Defining complexity classes */
|
787086457 |
2017-06-23T10:05:32Z |
Tea2min |
Reverted 2 edits by [[Special:Contributions/62.28.232.202|62.28.232.202]] ([[User talk:62.28.232.202|talk]]). ([[WP:TW|TW]])
|
787086076 |
2017-06-23T10:01:23Z |
62.28.232.202 |
/* Defining complexity classes */
|
787085268 |
2017-06-23T09:52:25Z |
62.28.232.202 |
/* Defining complexity classes */
|
782272490 |
2017-05-25T21:22:25Z |
90.178.41.151 |
factor an integer n, not n-bit integer
|
780478035 |
2017-05-15T11:02:38Z |
Esszet |
|
780477990 |
2017-05-15T11:02:15Z |
Esszet |
/* History */
|
778012777 |
2017-04-30T17:08:49Z |
86.173.191.67 |
/* History */
|
774990270 |
2017-04-11T22:58:45Z |
DocWatson42 |
Performed clean up.
|
772153986 |
2017-03-25T16:52:59Z |
Emir of Wikipedia |
Help needed: [[Complexity measure]]
|
770358849 |
2017-03-14T22:50:45Z |
ClueBot NG |
Reverting possible vandalism by [[Special:Contribs/95.187.83.249|95.187.83.249]] to version by 2001:B07:A12:98DD:34FB:42E:3C62:8DAB. [[WP:CBFP|Report False Positive?]] Thanks, [[WP:CBNG|ClueBot NG]]. (2971447) (Bot)
|
770358846 |
2017-03-14T22:50:43Z |
95.187.83.249 |
|
765537903 |
2017-02-15T00:05:41Z |
2001:B07:A12:98DD:34FB:42E:3C62:8DAB |
/* Best, worst and average case complexity */
|
761785410 |
2017-01-24T20:08:27Z |
ClueBot NG |
Reverting possible vandalism by [[Special:Contribs/2607:FEA8:2A1F:E676:4018:B849:BDE5:A5C|2607:FEA8:2A1F:E676:4018:B849:BDE5:A5C]] to version by DokReggar. [[WP:CBFP|Report False Positive?]] Thanks, [[WP:CBNG|ClueBot NG]]. (2909013) (Bot)
|
761785394 |
2017-01-24T20:08:23Z |
2607:FEA8:2A1F:E676:4018:B849:BDE5:A5C |
|
753465257 |
2016-12-07T09:19:06Z |
DokReggar |
/* Problems in NP not known to be in P or NP-complete */ fixed math, added reference
|
753462752 |
2016-12-07T08:53:43Z |
DokReggar |
/* Important complexity classes */ fixed table alignment
|
748818993 |
2016-11-10T15:52:17Z |
Pleasantville |
added [[Category:Computational fields of study]] using [[WP:HC|HotCat]]
|
741708720 |
2016-09-29T05:08:45Z |
Cedar101 |
/* Problems in NP not known to be in P or NP-complete */ ·
|
741706339 |
2016-09-29T04:50:24Z |
Cedar101 |
/* Hierarchy theorems */ it has become popular in recent years to write the names of complexity classes in a sans serif font
|
740862218 |
2016-09-23T20:00:47Z |
Staszek Lem |
/* History */
|
740862144 |
2016-09-23T20:00:12Z |
Staszek Lem |
/* History */
|
740861877 |
2016-09-23T19:57:57Z |
Staszek Lem |
/* History */
|
740697069 |
2016-09-22T18:14:09Z |
128.100.13.159 |
/* History */
|
740696835 |
2016-09-22T18:12:26Z |
128.100.13.159 |
/* History */
|
739930509 |
2016-09-18T00:28:55Z |
Lor |
Reverted edits by [[Special:Contributions/166.181.83.245|166.181.83.245]] ([[User talk:166.181.83.245|talk]]) ([[WP:HG|HG]]) (3.1.20)
|
739930173 |
2016-09-18T00:25:29Z |
166.181.83.245 |
|
738737236 |
2016-09-10T19:25:36Z |
ElricMelvar |
Replaced 'it' with what the pronoun refereed to, to increase readability.
|
728463249 |
2016-07-05T16:23:15Z |
Hairy Dude |
/* Important complexity classes */ fix css typo that defeats the purpose of this table
|
717517643 |
2016-04-28T05:44:04Z |
Cedar101 |
/* Problems in NP not known to be in P or NP-complete */ {{sqrt}}
|
717517565 |
2016-04-28T05:43:04Z |
Cedar101 |
/* Important complexity classes */ style="vertical-algin:top;"
|
714314677 |
2016-04-08T23:57:26Z |
Staszek Lem |
|
714207575 |
2016-04-08T09:22:36Z |
Neutronstar2 |
/* Machine models and complexity measures */
|
713914412 |
2016-04-06T14:35:50Z |
Porphyro |
|
711861462 |
2016-03-25T10:00:05Z |
MarioS |
no, PRIMES is in P (cf. AKS primality test).
|
711782495 |
2016-03-24T21:22:50Z |
Staszek Lem |
/* Problems in NP not known to be in P or NP-complete */
|
711782423 |
2016-03-24T21:22:15Z |
Staszek Lem |
/* Problems in NP not known to be in P or NP-complete */
|
711751868 |
2016-03-24T17:12:21Z |
90.178.41.151 |
|
710016869 |
2016-03-14T13:21:37Z |
SoSivr |
/* Textbooks */list of textbooks ordered by author surname (as it appeared to be approximately)
|
703607148 |
2016-02-06T14:33:09Z |
78.35.48.10 |
Undid revision 703544790 by [[Special:Contributions/223.24.16.3|223.24.16.3]] ([[User talk:223.24.16.3|talk]])
|
703606987 |
2016-02-06T14:31:37Z |
78.35.48.10 |
Undid revision 703546339 by [[Special:Contributions/223.24.16.3|223.24.16.3]] ([[User talk:223.24.16.3|talk]])
|
703546339 |
2016-02-06T04:08:46Z |
223.24.16.3 |
|
703544790 |
2016-02-06T03:52:10Z |
223.24.16.3 |
|
702605795 |
2016-01-31T16:45:57Z |
Tea2min |
Disambiguate [[graph (mathematics)]] to [[graph (discrete mathematics)]].
|
702588796 |
2016-01-31T14:25:40Z |
BD2412 |
[[Graph (mathematics)]] is now a disambiguation link; please fix., replaced: [[graph (mathematics)|graph]] → [[Graph (mathematics)|graph]]{{dn|{{subst:DATE}}}} (2), [[graph (mathematics)|graphs]] → [[Graph (mathematics) using [[Project:AWB|AWB]]
|
699414629 |
2016-01-12T04:50:45Z |
TAnthony |
/* Textbooks */Update deprecated cite parameter (coauthors) and genfixes using [[Project:AWB|AWB]]
|
697442440 |
2015-12-30T15:30:44Z |
46.19.86.109 |
Omitted redundant data
|
693552936 |
2015-12-03T08:28:15Z |
TakuyaMurata |
/* External links */
|
693552892 |
2015-12-03T08:27:43Z |
TakuyaMurata |
/* External links */ +1
|
678289296 |
2015-08-28T13:31:35Z |
Dexbot |
Bot: Deprecating [[Template:Cite doi]] and some minor fixes
|
677278876 |
2015-08-22T06:56:05Z |
Jimw338 |
/* Important complexity classes */ changed comma to semicolon
|
676228384 |
2015-08-15T15:58:11Z |
Tea2min |
Undid revision 676226030 by [[Special:Contributions/2607:FB90:124:A7A3:9CF3:C9C4:131:CD86|2607:FB90:124:A7A3:9CF3:C9C4:131:CD86]] ([[User talk:2607:FB90:124:A7A3:9CF3:C9C4:131:CD86|talk]])
|
676226030 |
2015-08-15T15:37:21Z |
2607:FB90:124:A7A3:9CF3:C9C4:131:CD86 |
|
674290238 |
2015-08-02T23:36:19Z |
The Transhumanist |
cleanup, general fixing, [[WP:AWB/T|typo(s) fixed]]: Nevertheless → Nevertheless, (2) using [[Project:AWB|AWB]]
|
672189308 |
2015-07-19T22:39:10Z |
Flyer22 Frozen |
Reverted 1 [[WP:AGF|good faith]] edit by [[Special:Contributions/31.4.153.43|31.4.153.43]] using [[WP:STiki|STiki]]
|
672182004 |
2015-07-19T21:33:00Z |
31.4.153.43 |
G
|
672181945 |
2015-07-19T21:32:24Z |
ClueBot NG |
Reverting possible vandalism by [[Special:Contributions/31.4.153.43|31.4.153.43]] to version by 131.159.0.47. False positive? [[User:ClueBot NG/FalsePositives|Report it]]. Thanks, [[User:ClueBot NG|ClueBot NG]]. (2294549) (Bot)
|
672181941 |
2015-07-19T21:32:21Z |
31.4.153.43 |
Faire b
|
671558234 |
2015-07-15T13:33:56Z |
131.159.0.47 |
/* Important complexity classes */
|
668026191 |
2015-06-22T00:57:12Z |
Nbarth |
/* top */ swap order of CCT vs. AoA (backwards)
|
667072215 |
2015-06-15T17:12:37Z |
Staszek Lem |
/* History */
|
667071473 |
2015-06-15T17:06:21Z |
Staszek Lem |
/* History */ this is not simply Homer's opinion
|
667053842 |
2015-06-15T14:42:04Z |
J. Finkelstein |
/* History */ removes pointless diagram; if this information is really necessary, there is certainly a better way of displaying it
|
665483442 |
2015-06-04T15:36:02Z |
ClueBot NG |
Reverting possible vandalism by [[Special:Contributions/83.110.66.38|83.110.66.38]] to version by KasparBot. False positive? [[User:ClueBot NG/FalsePositives|Report it]]. Thanks, [[User:ClueBot NG|ClueBot NG]]. (2263482) (Bot)
|
665483434 |
2015-06-04T15:35:59Z |
83.110.66.38 |
|
663121795 |
2015-05-19T18:15:49Z |
KasparBot |
embed authority control with wikidata information
|
656475550 |
2015-04-14T18:06:38Z |
115.242.167.58 |
|
649895389 |
2015-03-04T21:30:52Z |
141.206.171.2 |
/* History */
|
647743099 |
2015-02-18T18:32:26Z |
Monkbot |
/* Problems in NP not known to be in P or NP-complete */Task 1i: Fix [[Help:CS1_errors#deprecated_params|CS1 deprecated date parameter errors]]
|
646937763 |
2015-02-13T11:05:05Z |
Rjwilmsi |
/* Problems in NP not known to be in P or NP-complete */Journal cites, Added 2 dois to journal cites using [[Project:AWB|AWB]] (10820)
|
646937582 |
2015-02-13T11:03:12Z |
Rjwilmsi |
Journal cites, templated 1 journal cites using [[Project:AWB|AWB]] (10808)
|
642665843 |
2015-01-15T22:29:39Z |
David Eppstein |
authorlynx
|
641343113 |
2015-01-07T02:41:21Z |
Ethereal-Blade |
don't use "complex" in sentence unless it refers to the technical term
|
639786392 |
2014-12-27T08:24:42Z |
Tea2min |
Undid revision 639684059 by [[Special:Contributions/123.231.100.232|123.231.100.232]] ([[User talk:123.231.100.232|talk]])
|
639684059 |
2014-12-26T12:24:58Z |
123.231.100.232 |
/* Defining complexity classes */
|
630946195 |
2014-10-24T15:54:06Z |
Gilliam |
Reverted edits by [[Special:Contribs/199.127.135.126|199.127.135.126]] ([[User talk:199.127.135.126|talk]]) to last version by ClueBot NG
|
630945686 |
2014-10-24T15:49:55Z |
199.127.135.126 |
|
630944714 |
2014-10-24T15:41:51Z |
ClueBot NG |
Reverting possible vandalism by [[Special:Contributions/199.127.135.126|199.127.135.126]] to version by 128.100.122.180. False positive? [[User:ClueBot NG/FalsePositives|Report it]]. Thanks, [[User:ClueBot NG|ClueBot NG]]. (2003985) (Bot)
|
630944697 |
2014-10-24T15:41:46Z |
199.127.135.126 |
|
627730989 |
2014-09-30T21:13:05Z |
128.100.122.180 |
/* Important complexity classes */
|
627730130 |
2014-09-30T21:05:00Z |
128.100.122.180 |
/* Important complexity classes */ side by side tables (time constraint, space constraint)
|
626698971 |
2014-09-23T00:22:40Z |
173.206.42.163 |
Removed incorrect example. Finding a minimum of f is not the same as finding a value (what is a "feasible point"?) of x such that f(x) <= k
|
623789089 |
2014-09-02T00:51:58Z |
Dexbot |
Bot: Removing Link FA template
|
623766627 |
2014-09-01T21:37:12Z |
Materialscientist |
Reverted edits by [[Special:Contribs/Dexbot|Dexbot]] ([[User talk:Dexbot|talk]]) to last version by Deltahedron
|
623753765 |
2014-09-01T19:59:41Z |
Dexbot |
Bot: Removing Link FA template
|
620671095 |
2014-08-10T19:11:57Z |
Deltahedron |
Undid revision 620354546 by [[Special:Contributions/37.142.129.145|37.142.129.145]] ([[User talk:37.142.129.145|talk]])
|
620354546 |
2014-08-08T09:46:19Z |
37.142.129.145 |
Slight error in precise definition of a sub field of computer science
|
615615912 |
2014-07-04T20:17:12Z |
Emallove |
/* Function problems */ trivial: missing article "a"
|
615163095 |
2014-07-01T14:55:11Z |
Philip Trueman |
Reverted edits by [[Special:Contribs/112.198.82.43|112.198.82.43]] ([[User talk:112.198.82.43|talk]]) to last version by Dsimic
|
615160125 |
2014-07-01T14:29:33Z |
112.198.82.43 |
|
610017913 |
2014-05-25T02:06:45Z |
Dsimic |
/* See also */ Now it's lnked in the lead sectiob
|
610017865 |
2014-05-25T02:06:10Z |
Dsimic |
/* top */ Linked an article
|
609455865 |
2014-05-21T00:27:13Z |
Ja49cs69 |
/* See also */
|
609455761 |
2014-05-21T00:26:17Z |
Ja49cs69 |
/* See also */ added another item
|
607867082 |
2014-05-10T04:57:48Z |
Arthur Rubin |
Undid revision 607300863 by [[Special:Contributions/Dsimic|Dsimic]] ([[User talk:Dsimic|talk]]) please learn to read; if what you said was true, then NP would be a subset of P, not the other way around
|
607301091 |
2014-05-06T09:30:18Z |
Dsimic |
Punctuation; Deleted repeated linking of [[non-deterministic Turing machine]]
|
607300863 |
2014-05-06T09:27:16Z |
Dsimic |
/* P versus NP problem */ The article says in other place: "A non-deterministic Turing machine is a deterministic Turing machine with an added feature of non-determinism..."
|
607300453 |
2014-05-06T09:21:16Z |
Arthur Rubin |
Undid revision 606644075 by [[Special:Contributions/Mona Borham|Mona Borham]] ([[User talk:Mona Borham|talk]]) revert reversal
|
607300386 |
2014-05-06T09:20:18Z |
Arthur Rubin |
Undid revision 607293997 by [[Special:Contributions/Dsimic|Dsimic]] ([[User talk:Dsimic|talk]]) revert fix of reversal
|
607293997 |
2014-05-06T07:53:37Z |
Dsimic |
/* Important open problems */ Punctuation
|
606644075 |
2014-05-01T16:17:22Z |
Mona Borham |
/* Important open problems */
|
605492455 |
2014-04-23T18:41:34Z |
Jhertel |
/* Best, worst and average case complexity */ Added link to "Big O notation" at the first use of the actual O() notation, as the big O notation has not been *explained* earlier in this article (only shortly mentioned, but without explanation).
|
601922279 |
2014-03-30T05:37:27Z |
Dsimic |
Reverted edits by [[Special:Contribs/129.194.8.73|129.194.8.73]] ([[User talk:129.194.8.73|talk]]) to last version by 134.134.139.72
|
601658372 |
2014-03-28T14:30:16Z |
129.194.8.73 |
/* Problems in NP not known to be in P or NP bullshit-complete */
|
601658039 |
2014-03-28T14:27:21Z |
129.194.8.73 |
/* Problems in NP not known to be in P or NP-complete */
|
601160339 |
2014-03-25T07:29:12Z |
134.134.139.72 |
/* History */
|
601157998 |
2014-03-25T06:51:53Z |
134.134.139.74 |
/* Measuring the size of an instance */
|
601041339 |
2014-03-24T15:05:33Z |
Dsimic |
/* References */ Flexible multi-column layout
|
601041253 |
2014-03-24T15:04:54Z |
Dsimic |
/* See also */ Layout compaction
|
596210057 |
2014-02-19T17:34:56Z |
Wavelength |
/* See also */ alphabetizing list of internal links—[[WP:ALSO]]
|
596209845 |
2014-02-19T17:33:19Z |
Wavelength |
/* See also */ revising 1 redirected link
|
594041465 |
2014-02-05T13:08:23Z |
Philip Trueman |
[[Help:Reverting|Reverted]] edits by [[Special:Contributions/213.55.92.81|213.55.92.81]] ([[User talk:213.55.92.81|talk]]) to last version by Monkbot
|
594039843 |
2014-02-05T12:49:55Z |
213.55.92.81 |
/* Computational problems */
|
593840364 |
2014-02-04T04:39:06Z |
Monkbot |
/* P versus NP problem */Fix [[Help:CS1_errors#deprecated_params|CS1 deprecated date parameter errors]]
|
592918552 |
2014-01-29T06:15:10Z |
Amitkumarp |
Corrected a mistake which said about the problems which can be solved in theory.
|
590262047 |
2014-01-11T19:59:01Z |
Jpmunz |
/* Complexity classes */
|
585249337 |
2013-12-09T08:30:17Z |
92.128.101.151 |
/* Define complexity classes */
|
584336699 |
2013-12-03T08:28:24Z |
219.239.227.212 |
/* Complexity classes */
|
579662908 |
2013-10-31T21:18:24Z |
131.130.45.149 |
come on this is silly.
|
578459654 |
2013-10-23T21:21:16Z |
Policron |
Added an external link (EOM).
|
574662200 |
2013-09-26T21:57:43Z |
Jmencisom |
/* External links */
|
573885008 |
2013-09-21T07:50:49Z |
Bgwhite |
remove refbegin as isn't supposed to be used this way. Hardley see the refs. Center image
|
566407465 |
2013-07-30T10:55:42Z |
199.48.225.89 |
/* Continuous complexity theory */
|
565665066 |
2013-07-24T21:02:48Z |
Rogerdpack |
basically add more links to "algorithm" since that's what it is typically that's being measured.
|
564902361 |
2013-07-19T09:56:53Z |
Tea2min |
Reverted 2 edits by [[Special:Contributions/115.254.42.196|115.254.42.196]] ([[User talk:115.254.42.196|talk]]). ([[WP:TW|TW]])
|
564890638 |
2013-07-19T07:05:56Z |
115.254.42.196 |
/* Turing machine */
|
564890462 |
2013-07-19T07:03:30Z |
115.254.42.196 |
/* Turing machine */
|
563749626 |
2013-07-11T01:04:15Z |
Staszek Lem |
/* See also */
|
563749319 |
2013-07-11T01:01:13Z |
Staszek Lem |
/* History */
|
563716555 |
2013-07-10T20:28:55Z |
Alexbrandts |
|
561560583 |
2013-06-25T19:07:29Z |
Orange Suede Sofa |
/* Complexity measures */ caps per article convention on [[big O notation]]
|
561523710 |
2013-06-25T14:37:30Z |
Carbo1200 |
/* Complexity measures */ link to Big O notation
|
560940458 |
2013-06-21T17:26:59Z |
Arthur Rubin |
Reverted [[WP:AGF|good faith]] edits by [[Special:Contributions/Maurice Carbonaro|Maurice Carbonaro]] ([[User talk:Maurice Carbonaro|talk]]): This is covering a _mathematical_ instance, not the instance in _computer science_. ([[WP:TW|TW]])
|
560881107 |
2013-06-21T11:04:47Z |
Maurice Carbonaro |
/* Problem instances */Hyperlinked "(...) [[Instance (computer science)|instance]] (...)" with the "[[Instance (computer science)]]" article.
|
559852937 |
2013-06-14T10:13:02Z |
Rjwilmsi |
cleanup of [[Category:Pages with citations having redundant parameters]], using [[Project:AWB|AWB]] (9253)
|
559456835 |
2013-06-11T22:07:43Z |
David Eppstein |
/* Surveys */ remove bogus parameter from ref
|
559456647 |
2013-06-11T22:06:11Z |
David Eppstein |
/* Textbooks */ clean up references
|
559163033 |
2013-06-10T03:00:44Z |
64.134.229.26 |
/* See also */ collision
|
559162182 |
2013-06-10T02:54:04Z |
64.134.229.26 |
/* Computational problems */ ludicrous precision
|
558613192 |
2013-06-06T14:58:27Z |
101.111.248.146 |
/* External links */
|
556832746 |
2013-05-26T07:06:10Z |
Chowbok |
/* Problem instances */[[WP:GENFIXES|General fixes]], replaced: in length → long using [[Project:AWB|AWB]]
|
556166337 |
2013-05-21T21:23:00Z |
Julianiacoponi |
/* Decision problems as formal languages */
|
550478443 |
2013-04-15T14:29:24Z |
Orange Suede Sofa |
Undid revision 550469126 by [[Special:Contributions/Thesolveengine|Thesolveengine]] ([[User talk:Thesolveengine|talk]]) - removed [[WP:LINKSPAM|linkspam]]
|
550469126 |
2013-04-15T13:11:58Z |
Djhulme |
/* External links */
|
549675029 |
2013-04-10T13:02:58Z |
Yobot |
[[WP:CHECKWIKI]] error fixes using [[Project:AWB|AWB]] (9075)
|
545616553 |
2013-03-20T06:25:09Z |
76.169.211.69 |
Changed wording of "roughly" to "same order of magnitude"
|
544034285 |
2013-03-14T07:32:44Z |
InverseHypercube |
/* Turing Machine */ uncap. 'Machine'
|
541158509 |
2013-02-28T06:01:30Z |
66.205.158.7 |
|
539071486 |
2013-02-19T17:19:14Z |
Addbot |
[[User:Addbot|Bot:]] Updating 34 interwikilinks per [[Wikipedia:Wikidata|Wikidata]] [[d:q205084]] ([[User talk:Addbot|Report Errors]])
|
532224060 |
2013-01-09T18:56:01Z |
129.105.36.177 |
/* Function problems */
|
531114053 |
2013-01-03T17:22:31Z |
Daniel Quinlan |
Undid revision 441046345 by [[Special:Contributions/117.199.153.238|117.199.153.238]] ([[User talk:117.199.153.238|talk]])
|
530261445 |
2012-12-29T07:17:54Z |
LJosil |
/* History */
|
530260425 |
2012-12-29T07:06:25Z |
LJosil |
/* History */
|
527774261 |
2012-12-12T23:00:44Z |
Orange Suede Sofa |
[[Help:Reverting|Reverted]] edits by [[Special:Contributions/139.57.60.129|139.57.60.129]] ([[User talk:139.57.60.129|talk]]) to last version by Brianbjparker
|
527773914 |
2012-12-12T22:58:03Z |
139.57.60.129 |
|
523582724 |
2012-11-18T00:11:22Z |
Brianbjparker |
/* History */ fixed typo
|
523582594 |
2012-11-18T00:10:16Z |
Brianbjparker |
/* History */ Added Edmonds to history section
|
522298742 |
2012-11-10T07:38:13Z |
Deltahedron |
/* Textbooks */ zblatt
|
521801492 |
2012-11-07T09:40:10Z |
Maurice Carbonaro |
/* Computational problems */ Enlarged [[Image:TSP Deutschland 3.png]] Germany image from 200px to 333[[pixels|px]]: I guess is a good example that deserves notability. But plz feel free to undo. Thanks.
|
521451978 |
2012-11-05T02:26:20Z |
196.15.16.104 |
/* External links */ URL corrected
|
518239919 |
2012-10-17T01:57:44Z |
EmausBot |
r2.7.2+) (Robot: Modifying [[fr:Théorie de la complexité (informatique théorique)]]
|
517335102 |
2012-10-12T06:41:04Z |
Braincricket |
clean up, [[WP:AWB/T|typos fixed]]: so called → so-called using [[Project:AWB|AWB]] (8414)
|
515469837 |
2012-10-01T14:33:47Z |
EmausBot |
r2.7.2+) (Robot: Modifying [[he:תורת הסיבוכיות]]
|
511635483 |
2012-09-10T03:43:37Z |
דוד שי |
/* External links */ Interwiki he
|
510779221 |
2012-09-04T16:35:54Z |
84.203.238.90 |
Wording. Less condescending.
|
510779142 |
2012-09-04T16:35:23Z |
84.203.238.90 |
Wording. Less condescending.
|
509735790 |
2012-08-29T08:22:24Z |
JYBot |
r2.7.1) (Robot: Modifying [[pt:Complexidade computacional]]
|
504294088 |
2012-07-26T17:01:40Z |
Aaron Nitro Danielson |
Small edit to translate ambiguous words to simpler, more precise, 'plain English' terms.
|
504168913 |
2012-07-25T20:55:49Z |
Toddy1 |
Undid revision 503735135 by [[Special:Contributions/76.102.1.193|76.102.1.193]] ([[User talk:76.102.1.193|talk]]) original explained when it started to flourish
|
503735135 |
2012-07-23T08:32:29Z |
76.102.1.193 |
removes informal superlative
|
503446662 |
2012-07-21T15:27:33Z |
Phil Boswell |
convert dodgy URL to ID using [[Project:AWB|AWB]]
|
503039847 |
2012-07-18T23:50:30Z |
MichiHenning |
/* P versus NP problem */ [[WP:OVERLINK]]
|
492509619 |
2012-05-14T12:27:54Z |
MarcelB612 |
/* Turing Machine */
|
492217422 |
2012-05-12T15:54:46Z |
Helpful Pixie Bot |
ISBNs (Build KH)
|
490810652 |
2012-05-05T16:56:44Z |
97.81.29.81 |
/* Problem instances */
|
475758988 |
2012-02-08T13:51:12Z |
RedBot |
r2.5.2) (Robot: Adding [[bg:Теория на изчислителната сложност]]
|
472134991 |
2012-01-19T21:59:12Z |
Mastergreg82 |
Undid revision 471990169 by [[Special:Contributions/118.179.212.10|118.179.212.10]] ([[User talk:118.179.212.10|talk]])
|
471990169 |
2012-01-18T04:08:45Z |
118.179.212.10 |
/* Problem instances */
|
468629481 |
2011-12-30T17:42:48Z |
91.99.222.229 |
/* Upper and lower bounds on the complexity of problems */
|
467016001 |
2011-12-21T12:32:01Z |
JAnDbot |
r2.5.2) (Robot: Modifying [[nl:Computationele complexiteitstheorie]], [[ru:Вычислительная сложность]]
|
465690833 |
2011-12-13T19:55:40Z |
Rehua |
/* Decision problems as formal languages */ PNG to SVG
|
465690731 |
2011-12-13T19:54:58Z |
Rehua |
/* Representing problem instances */
|
464897544 |
2011-12-09T04:31:55Z |
AidaFernandaUFPE |
/* External links */
|
460038599 |
2011-11-10T22:21:00Z |
RussBot |
Robot: disambiguate [[RSA]]
|
459441128 |
2011-11-07T11:19:11Z |
158.223.71.246 |
/* Problem instances */ fixed minor grammar error
|
459075236 |
2011-11-05T02:20:01Z |
JohnBlackburne |
[[Help:Reverting|Reverted]] edits by [[Special:Contributions/Brad7777|Brad7777]] ([[User talk:Brad7777|talk]]) to last version by LokiClock
|
458955052 |
2011-11-04T11:16:58Z |
Brad7777 |
/* External links */ added Category:Subdivisions of mathematics
|
457936058 |
2011-10-29T06:57:17Z |
LokiClock |
|
457936033 |
2011-10-29T06:56:59Z |
LokiClock |
definition, "& relating classes to eachother"
|
453569541 |
2011-10-02T18:58:32Z |
207.204.113.172 |
|
453569297 |
2011-10-02T18:56:36Z |
207.204.113.172 |
|
451904638 |
2011-09-22T20:10:38Z |
Wayne Slam |
Reverted edits by [[Special:Contributions/86.16.59.91|86.16.59.91]] ([[User talk:86.16.59.91|talk]]) to last revision by CitationCleanerBot ([[WP:HG|HG]])
|
451904617 |
2011-09-22T20:10:33Z |
86.16.59.91 |
|
451274041 |
2011-09-19T05:40:23Z |
CitationCleanerBot |
Various citation cleanup + [[WP:AWB]] fixes . Report errors and suggestions at [[User talk:CitationCleanerBot]]
|
448202831 |
2011-09-03T09:55:08Z |
211.27.152.60 |
/* Decision problems as formal languages */
|
447214012 |
2011-08-28T23:07:05Z |
Huynl |
|
443933639 |
2011-08-09T20:44:12Z |
FrescoBot |
Bot: links syntax
|
441046345 |
2011-07-23T19:12:30Z |
117.199.153.238 |
/* Best, worst and average case complexity */
|
439040179 |
2011-07-12T06:13:01Z |
Dragonflare82 |
included paranthetical examples
|
438862042 |
2011-07-11T05:39:38Z |
128.200.38.151 |
/* Intractability */ Tried to improve readability of the first line of this section
|
438708722 |
2011-07-10T07:57:04Z |
24.80.225.24 |
/* Separations between other complexity classes */
|
438708616 |
2011-07-10T07:55:59Z |
24.80.225.24 |
/* Separations between other complexity classes */
|
438708300 |
2011-07-10T07:52:44Z |
24.80.225.24 |
/* Problems in NP not known to be in P or NP-complete */ notation
|
434310477 |
2011-06-14T22:18:54Z |
212.87.13.71 |
/* Separations between other complexity classes */
|
433512291 |
2011-06-10T06:36:40Z |
Koavf |
new key for [[Category:Computational complexity theory]]: " " using [[Help:Gadget-HotCat|HotCat]]
|
429572771 |
2011-05-17T15:26:32Z |
Citation bot |
[344]+: unused_data.
|
428506251 |
2011-05-11T00:35:17Z |
Ryulong |
[[Help:Reverting|Reverted]] edits by [[Special:Contributions/112.198.245.73|112.198.245.73]] ([[User talk:112.198.245.73|talk]]) to last version by Gaius Cornelius
|
428506197 |
2011-05-11T00:34:49Z |
112.198.245.73 |
/* Measuring the size of an instance */
|
428506145 |
2011-05-11T00:34:24Z |
112.198.245.73 |
/* Hierarchy theorems */
|
428384151 |
2011-05-10T07:18:53Z |
Gaius Cornelius |
Tidy using [[Project:AWB|AWB]]
|
427328239 |
2011-05-04T00:46:11Z |
108.17.65.79 |
|
427328069 |
2011-05-04T00:44:44Z |
108.17.65.79 |
|
426907813 |
2011-05-01T16:19:57Z |
Krishnachandranvn |
/* See also */
|
424544845 |
2011-04-17T16:36:24Z |
186.109.102.172 |
/* Best, worst and average case complexity */
|
424516570 |
2011-04-17T12:41:04Z |
Pete142 |
|
424516332 |
2011-04-17T12:38:30Z |
Pete142 |
|
424515767 |
2011-04-17T12:32:29Z |
Pete142 |
Just a stylistic change: replaced "a large amount of resources" with "significant resources"
|
424363425 |
2011-04-16T13:26:20Z |
Pete142 |
Made one sentence a little clearer (I hope)
|
422955211 |
2011-04-08T01:58:12Z |
Citation bot 1 |
[Pu334]+: arxiv.
|
421871510 |
2011-04-01T20:00:49Z |
Citation bot |
Citations: [266]Tweaked: pages. Unified citation types. User-activated.
|
421869716 |
2011-04-01T19:48:28Z |
Ylloh |
/* Textbooks */ added first name
|
421869463 |
2011-04-01T19:46:44Z |
Ylloh |
/* Textbooks */ typo in Boaz' name
|
421154753 |
2011-03-28T15:04:00Z |
Ruud Koot |
/* Textbooks */ editor1-link
|
421047640 |
2011-03-27T21:58:10Z |
Rednas1234 |
/* Textbooks */
|
419494639 |
2011-03-18T17:54:52Z |
Ptbotgourou |
r2.6.5) (robot Modifying: [[es:Teoría de la complejidad computacional]]
|
419238615 |
2011-03-17T03:33:54Z |
173.77.222.40 |
|
417969331 |
2011-03-09T15:24:12Z |
71.206.132.43 |
the differences between analysis of algorithms and computational complexity have been mixed up (change the order of the 2 to represent the correct 'latter' and 'former'.
|
415366285 |
2011-02-22T19:20:08Z |
Rich Farmbrough |
Copyedit and minor fixes using [[Project:AWB|AWB]]
|
413380750 |
2011-02-11T22:48:47Z |
95.26.58.14 |
/* Representing problem instances */
|
413380632 |
2011-02-11T22:47:57Z |
95.26.58.14 |
/* Representing problem instances */
|
413380473 |
2011-02-11T22:46:59Z |
95.26.58.14 |
/* Representing problem instances */
|
412846071 |
2011-02-09T03:04:24Z |
Headbomb |
fix
|
411100423 |
2011-01-31T04:24:34Z |
RobinK |
Reverted 1 edit by [[Special:Contributions/Themusicgod1|Themusicgod1]] ([[User talk:Themusicgod1|talk]]); The image only shows the subset relation. It doesn't claim that these are strict subsets. I think the picture is useful. ([[WP:TW|TW]])
|
411045747 |
2011-01-30T22:30:39Z |
Themusicgod1 |
This graph contains relations which have not been proven, and thus is potentially misleading.
|
408988239 |
2011-01-20T15:38:48Z |
129.59.190.114 |
/* Problem instances */ fixed typo
|
407388456 |
2011-01-12T01:40:23Z |
142.68.155.65 |
|
406886590 |
2011-01-09T15:39:04Z |
Dlu776 |
/* Surveys */
|
403470200 |
2010-12-21T03:53:14Z |
210.50.55.154 |
Corrected "varry" to "vary".
|
403204262 |
2010-12-19T17:41:52Z |
62.203.247.235 |
/* Other machine models */ Added a space between a period and the start of the next sentence
|
403002455 |
2010-12-18T11:35:23Z |
Hermel |
/* History */ add reference
|
402123651 |
2010-12-13T10:42:46Z |
ErrantX |
/* History */ fixes per [[WP:MOSQUOTE]]
|
401798103 |
2010-12-11T16:43:29Z |
AvnishIT |
Alternate models of turing machine have the same computational powers i.e they may not be able to recognize any extra languages. The time and space consumptions may vary a lot .
|
398883161 |
2010-11-26T00:12:44Z |
78.149.0.124 |
/* Representing problem instances */
|
398882913 |
2010-11-26T00:10:50Z |
78.149.0.124 |
|
395861636 |
2010-11-10T02:11:12Z |
184.163.217.75 |
|
395210380 |
2010-11-06T18:46:12Z |
Hermel |
/* History */ wikify
|
394243738 |
2010-11-01T20:55:25Z |
Hermel |
Undid revision 394126882 by [[Special:Contributions/89.241.228.220|89.241.228.220]] ([[User talk:89.241.228.220|talk]]) not a key point, as major parts of complexity theory are model-independent
|
394126882 |
2010-11-01T07:07:31Z |
89.241.228.220 |
|
387877587 |
2010-09-30T08:24:50Z |
Sae1962 |
Links added & one correction (many tape --> many tapes) made
|
387874307 |
2010-09-30T07:51:13Z |
Sae1962 |
Minor corrections
|
383020384 |
2010-09-05T08:04:00Z |
59.99.138.41 |
/* Complexity measures */
|
378690793 |
2010-08-13T10:17:18Z |
John Vandenberg |
/* Important open problems */ link [[NP-intermediate]]
|
378558830 |
2010-08-12T16:23:08Z |
C. lorenz |
Undid revision 378548844 by [[Special:Contributions/223.223.129.164|223.223.129.164]] ([[User talk:223.223.129.164|talk]])
|
378548844 |
2010-08-12T15:13:53Z |
223.223.129.164 |
|
378425061 |
2010-08-11T20:59:34Z |
66.250.141.150 |
/* Separations between other complexity classes */
|
370682185 |
2010-06-28T22:25:06Z |
Dmcq |
Reverted 2 edits by [[Special:Contributions/204.128.192.4|204.128.192.4]]; Uncited Can't include [[WP:original research]]. ([[WP:TW|TW]])
|
370678704 |
2010-06-28T22:00:01Z |
204.128.192.4 |
/* Complexity and Encryption */
|
370678620 |
2010-06-28T21:59:24Z |
204.128.192.4 |
algorithm
|
370049895 |
2010-06-25T07:07:00Z |
JRSpriggs |
undo last two edits: another "proof" that NP = P.
|
370002525 |
2010-06-24T23:47:16Z |
204.128.192.4 |
changed is to are
|
369993118 |
2010-06-24T22:34:01Z |
204.128.192.4 |
set
|
369598557 |
2010-06-22T19:15:47Z |
Hermel |
Undid revision 369558040 by [[Special:Contributions/74.3.4.111|74.3.4.111]] ([[User talk:74.3.4.111|talk]])
|
369558040 |
2010-06-22T15:05:10Z |
74.3.4.111 |
|
368762332 |
2010-06-18T08:20:34Z |
JRSpriggs |
undo two edits by 117.197.234.72 as unhelpful: corrupted mdash and definition out of place (and perhaps incorrect).
|
368747427 |
2010-06-18T06:12:13Z |
117.197.234.72 |
/* Decision problems as formal languages */
|
368747175 |
2010-06-18T06:10:38Z |
117.197.234.72 |
/* Decision problems as formal languages */
|
367225510 |
2010-06-10T15:46:19Z |
Citation bot 1 |
Citations: [Pu162]+: postscript. Tweaked: issue. Unified citation types. You can [[WP:UCB|use this bot]] yourself! [[WP:DBUG|Report bugs here]].
|
366952244 |
2010-06-09T08:16:15Z |
Xqbot |
robot Modifying: [[ro:Teoria complexității]]
|
365122103 |
2010-05-31T00:35:47Z |
Bubba73 |
/* Computational problems */ commas in numbers
|
363854885 |
2010-05-24T03:50:56Z |
RobinK |
changed cite to citation related changes
|
363236630 |
2010-05-20T17:54:12Z |
128.59.215.133 |
/* Defining complexity classes */
|
362442288 |
2010-05-16T15:24:07Z |
MassimoLauria |
/* See also */
|
361645309 |
2010-05-12T08:55:27Z |
Muditjai |
/* Reduction */
|
359407265 |
2010-05-01T08:27:14Z |
AvicAWB |
clean up using [[Project:AWB|AWB]]
|
359038069 |
2010-04-29T11:24:06Z |
Johnuniq |
[[Help:Reverting|Reverted]] edits by [[Special:Contributions/125.16.17.151|125.16.17.151]] ([[User talk:125.16.17.151|talk]]) to last version by 174.91.234.29
|
358997049 |
2010-04-29T05:07:43Z |
125.16.17.151 |
/* Upper and lower bounds on the complexity of problems */
|
358993063 |
2010-04-29T04:35:48Z |
174.91.234.29 |
|
358093830 |
2010-04-24T22:31:38Z |
75.2.138.137 |
Minor-
|
357276357 |
2010-04-20T20:51:55Z |
Xqbot |
robot Removing: [[tr:Hesap karmaşıklığı kuramı]]
|
356265884 |
2010-04-15T22:37:37Z |
173.168.177.217 |
/* Problem instances */ Space between "10" and "km". Check the style guide.
|
356122182 |
2010-04-15T06:30:11Z |
76.126.243.135 |
/* Turing Machine */
|
354358563 |
2010-04-06T17:44:44Z |
Bethnim |
Continuous complexity theory
|
353617190 |
2010-04-02T21:28:23Z |
Quotient group |
previous wording suggested that resources were independent of algorithm used
|
353608837 |
2010-04-02T20:39:43Z |
RobinK |
/* Textbooks */ used template Garey-Johnson
|
353482435 |
2010-04-02T03:43:07Z |
Groupthink |
Undid revision 353460779 by [[Special:Contributions/Jamesd9007|Jamesd9007]] ([[User talk:Jamesd9007|talk]])
|
353460779 |
2010-04-02T01:13:41Z |
Jamesd9007 |
|
353042423 |
2010-03-30T22:28:05Z |
Hermel |
/* Textbooks */ wikify
|
353041886 |
2010-03-30T22:24:35Z |
Hermel |
/* Intractability */
|
352918715 |
2010-03-30T09:06:18Z |
David.Monniaux |
/* Textbooks */ +Garey/Johnson
|
351450366 |
2010-03-22T22:23:07Z |
Ptbotgourou |
robot Modifying: [[fr:Théorie de la complexité des algorithmes]]
|
351028236 |
2010-03-20T19:20:33Z |
24.17.243.68 |
/* Turing Machine */
|
348038115 |
2010-03-06T03:57:47Z |
JRSpriggs |
/* See also */ fix link
|
347299708 |
2010-03-02T14:36:49Z |
JRSpriggs |
undo last two edits: I should have said "universal" not "complete"; new sentence makes even less sense, so forget it.
|
346942136 |
2010-02-28T20:09:40Z |
RobinK |
/* Turing Machine */ changed the last sentence; previous sentence didn't make sense to me.
|
346929651 |
2010-02-28T19:03:02Z |
JRSpriggs |
/* Turing Machine */ try to satisfy 71.71.100.49 with a separate sentence at end of paragraph
|
346827481 |
2010-02-28T05:39:37Z |
RobinK |
Reverted 1 edit by [[Special:Contributions/71.71.100.49|71.71.100.49]]; The key idea here is to explain that a Turing machine is universal, not to talk about other things that are also universal. ([[WP:TW|TW]])
|
346814567 |
2010-02-28T03:49:16Z |
71.71.100.49 |
Undid revision 346232436 ([[User talk:JRSpriggs|talk]]) The use of turing complete demonstrates the universal nature of an algorithm, the efficiency of specialized vs universal is irrelevant
|
346704563 |
2010-02-27T16:43:56Z |
CRGreathouse |
Unlinked: [[Binary alphabet]] using [[tools:~dispenser/view/Dab_solver|Dab solver]]
|
346530819 |
2010-02-26T18:19:28Z |
67.78.138.82 |
Typo: in -> is
|
346232436 |
2010-02-25T04:12:19Z |
JRSpriggs |
undo last two edits: complete Turing machines merely simulate other Turing machines, even more inefficiently.
|
346039093 |
2010-02-24T05:43:59Z |
71.71.100.49 |
/* Turing Machine */
|
346039025 |
2010-02-24T05:43:25Z |
71.71.100.49 |
/* Turing Machine */
|
345237149 |
2010-02-20T16:34:45Z |
Nallimbot |
robot Modifying: [[fr:Théorie de la complexité]]
|
342943266 |
2010-02-09T15:27:05Z |
Calculuslover800 |
/* Problems in NP not known to be in P or NP-complete */
|
340511411 |
2010-01-28T11:38:42Z |
Dmcq |
Reverted 1 edit by [[Special:Contributions/76.240.78.196|76.240.78.196]]; Remove formula stuck into random place. ([[WP:TW|TW]])
|
340459736 |
2010-01-28T03:11:10Z |
76.240.78.196 |
/* Problems in NP not known to be in P or NP-complete */
|
340220819 |
2010-01-26T22:26:36Z |
Quotient group |
/* Problems in NP not known to be in P or NP-complete */ link
|
337006169 |
2010-01-10T15:14:10Z |
RobinK |
Moved image to the section where average case complexity is discussed.
|
337004036 |
2010-01-10T14:58:50Z |
Quackor |
added a caption image
|
336569370 |
2010-01-08T09:37:29Z |
Fuujuhi |
/* Problems in NP not known to be in P or NP-complete */ Fixed complexity formula for Number Field Sieve (cfr Carl Pomerance paper)
|
335437520 |
2010-01-02T10:23:18Z |
Nneonneo |
/* Important complexity classes */ add missing Space
|
331801162 |
2009-12-15T13:04:21Z |
Déjà Vu |
/* Best, worst and average case complexity */
|
331187380 |
2009-12-12T01:12:06Z |
131.107.0.77 |
/* Defining complexity classes */
|
330923287 |
2009-12-10T20:01:32Z |
174.113.188.7 |
/* Measuring the size of an instance */
|
330206700 |
2009-12-07T07:36:23Z |
Manway |
Reverted edits by [[Special:Contributions/70.246.232.155|70.246.232.155]] to last revision by RobinK ([[Wikipedia:Huggle|HG]])
|
330206679 |
2009-12-07T07:36:07Z |
70.246.232.155 |
|
327986929 |
2009-11-26T04:18:13Z |
RobinK |
General edits
|
327985878 |
2009-11-26T04:08:42Z |
RobinK |
/* See also */ added more links + picture
|
327985743 |
2009-11-26T04:07:32Z |
RobinK |
/* Turing Machine */
|
327985011 |
2009-11-26T04:00:55Z |
RobinK |
/* Turing Machine */ added more examples of TMs; added explanations for DTMs, NTMs and PTMs.
|
327981691 |
2009-11-26T03:32:20Z |
RobinK |
Shifted "Theory of Computational Complexity" to text books.
|
327981028 |
2009-11-26T03:26:09Z |
RobinK |
Removed the "translate from German" tag; I think everything that can be translated has been incorporated into this article.
|
327980865 |
2009-11-26T03:24:39Z |
RobinK |
/* Important complexity classes */ explained what "exponential" means = 2^poly(n)
|
327980521 |
2009-11-26T03:21:52Z |
RobinK |
/* Intractability */ tried to fix up this section a bit
|
327979979 |
2009-11-26T03:16:54Z |
RobinK |
/* Turing Machine */
|
327979870 |
2009-11-26T03:15:54Z |
RobinK |
/* Turing Machine */
|
327976877 |
2009-11-26T02:48:55Z |
Citation bot |
Citation maintenance. [71]Formatted: author, doi. Unified citation types. [[User:RobinK|RobinK]]
|
327226497 |
2009-11-22T03:31:39Z |
RobinK |
/* Important open problems */ section rewrite
|
327220659 |
2009-11-22T02:42:53Z |
RobinK |
Converted some complexity class names to plain text (from bold) to make the article consistent.
|
327220118 |
2009-11-22T02:38:54Z |
RobinK |
/* Computational problems */ reworded
|
327116918 |
2009-11-21T14:51:22Z |
RobinK |
/* Important complexity classes */ maybe the extra column isn't needed
|
327116727 |
2009-11-21T14:49:38Z |
RobinK |
/* Important complexity classes */ changed text to table + other changes
|
326877898 |
2009-11-20T05:22:33Z |
Yill577 |
/* History */
|
326877744 |
2009-11-20T05:21:26Z |
Yill577 |
/* Graph isomorphism problem */
|
326754310 |
2009-11-19T16:41:27Z |
RobinK |
/* Turing Machine */ added image
|
326754216 |
2009-11-19T16:40:46Z |
RobinK |
/* Important complexity classes */ added image
|
326747627 |
2009-11-19T15:56:01Z |
RobinK |
/* Complexity classes */ general reorganization + TeX -> HTML
|
325924866 |
2009-11-15T05:02:15Z |
RobinK |
/* Intractability */ removing image according to discussion on Talk
|
325919540 |
2009-11-15T04:16:19Z |
RobinK |
Separated notes and references
|
325918789 |
2009-11-15T04:09:38Z |
RobinK |
Reorganised references
|
325844895 |
2009-11-14T19:38:19Z |
RobinK |
/* See also */
|
325844392 |
2009-11-14T19:35:03Z |
RobinK |
/* Textbooks and surveys */
|
325836924 |
2009-11-14T18:47:01Z |
Citation bot |
Citation maintenance. [68]Added: last2, first2, issue. Formatted: coauthors, author. Unified citation types. [[User:Rjwilmsi|Rjwilmsi]]
|
323438545 |
2009-11-02T08:23:44Z |
Miym |
/* Function Problems */ title case -> sentence case
|
323409751 |
2009-11-02T03:50:07Z |
RobinK |
|
323409455 |
2009-11-02T03:47:53Z |
RobinK |
more ref formatting
|
323408509 |
2009-11-02T03:40:55Z |
RobinK |
/* Textbooks and surveys */ formatted refs
|
323407487 |
2009-11-02T03:33:36Z |
RobinK |
/* Important open problems */ rearranged text; added more content
|
323399090 |
2009-11-02T02:31:17Z |
RobinK |
/* Reduction */ expanded section
|
323254779 |
2009-11-01T10:26:56Z |
Miym |
/* Function Problems */ html math
|
323192072 |
2009-11-01T00:09:34Z |
RobinK |
rearranged sections to make it coherent
|
323175013 |
2009-10-31T22:06:19Z |
RobinK |
/* Machine models and complexity measures */ added subsection on TMs, which should be described in short
|
322398320 |
2009-10-27T20:03:39Z |
RobinK |
/* Important complexity classes */ typo
|
322398213 |
2009-10-27T20:03:09Z |
RobinK |
/* Complexity classes */ reorganized text and added some text about the variety of complexity classes
|
322394877 |
2009-10-27T19:45:33Z |
RobinK |
/* Hierarchy theorems */ German article again
|
322393122 |
2009-10-27T19:36:10Z |
RobinK |
/* Textbooks and surveys */ reformatted ref
|
322392541 |
2009-10-27T19:32:41Z |
RobinK |
/* Defining complexity classes */
|
322392323 |
2009-10-27T19:31:20Z |
RobinK |
/* Complexity classes */ More german article stuff and editing
|
322198394 |
2009-10-26T20:06:07Z |
RobinK |
/* Intractability */ changed complete to hard
|
322198113 |
2009-10-26T20:04:19Z |
RobinK |
/* Textbooks and surveys */ Added Papadimitriou (the complexity bible) and removed "Algorithms and Complexity" which is almost entirely an algorithms book
|
322126199 |
2009-10-26T13:11:19Z |
RobinK |
removed the big image in the lead; discuss placement on talk page
|
322124567 |
2009-10-26T13:00:01Z |
Miym |
[[WP:UNDO|Undid]] revision 322110751 by [[Special:Contributions/118.95.45.138|118.95.45.138]] ([[User talk:118.95.45.138|talk]])
|
322110751 |
2009-10-26T10:58:40Z |
118.95.45.138 |
/* Representing problem instances */
|
322089366 |
2009-10-26T06:54:53Z |
Miym |
changed the image alignment so that the table of contents is after the image (TOC and image interfered with each other badly, depending on the size of the browser window)
|
322069658 |
2009-10-26T03:36:20Z |
RobinK |
rearranged some text
|
322068873 |
2009-10-26T03:29:07Z |
RobinK |
/* Machine models and complexity measures */ more rewriting/editing
|
322065114 |
2009-10-26T02:59:00Z |
RobinK |
/* Computational problems */ rewording and added a bit from the german article
|
322062749 |
2009-10-26T02:41:40Z |
RobinK |
Added [[File:Theoretical computer science.svg]]
|
321339748 |
2009-10-22T06:58:17Z |
Charvest |
|
321339236 |
2009-10-22T06:52:18Z |
Charvest |
|
321321120 |
2009-10-22T03:38:46Z |
RobinK |
/* Measuring the size of an instance */ more stuff from the German article
|
321319607 |
2009-10-22T03:25:21Z |
RobinK |
/* Measuring the size of the instance */
|
321319299 |
2009-10-22T03:22:22Z |
RobinK |
/* Computational problems */ continued translation from German article and other editing
|
321099077 |
2009-10-20T23:51:59Z |
RobinK |
/* Decision problems as formal languages */
|
321097373 |
2009-10-20T23:41:28Z |
RobinK |
/* Decision problems as formal languages */ using phrase "input string" instead of "input word"
|
321097217 |
2009-10-20T23:40:18Z |
RobinK |
/* Problem instances */ copyedit
|
320485743 |
2009-10-17T22:20:54Z |
RobinK |
/* Computational problems */ added decision problem image
|
320339720 |
2009-10-17T03:25:35Z |
RobinK |
/* Computational problems */ reorganized content; added content; edited to make things clearer
|
320334298 |
2009-10-17T02:38:38Z |
RobinK |
/* Problems from the viewpoint of computational complexity */ change section name to "Computational problems"
|
320276520 |
2009-10-16T20:13:26Z |
RobinK |
Changed lead section. Hope I've improved it.
|
320064332 |
2009-10-15T19:00:14Z |
Zorrobot |
robot Adding: [[no:Kompleksitetsteori]]
|
319855920 |
2009-10-14T18:22:05Z |
RobinK |
/* History */ removed list of complexity researchers; see talk page
|
319786630 |
2009-10-14T10:26:15Z |
Hermel |
[[WP:UNDO|Undid]] revision 319782168 by [[Special:Contributions/171.66.35.76|171.66.35.76]] ([[User talk:171.66.35.76|talk]])
|
319782168 |
2009-10-14T09:30:24Z |
171.66.35.76 |
/* History */
|
319753732 |
2009-10-14T03:59:17Z |
189.11.131.254 |
/* Decision problems as formal languages */
|
316887995 |
2009-09-29T14:14:33Z |
RobinK |
changed poly-exponential to exponential
|
316840200 |
2009-09-29T07:06:58Z |
99.236.25.231 |
/* Important time complexity classes */ all the nondeterrministic time complexity classes were defined as deterministic
|
316665262 |
2009-09-28T12:01:38Z |
Hermel |
/* History */ completely rewritten from scratch
|
316533161 |
2009-09-27T18:14:05Z |
Hermel |
/* Machine models and complexity measures */ continued translation from German article
|
316530547 |
2009-09-27T17:57:27Z |
Miym |
fix HTML math
|
316514499 |
2009-09-27T16:27:34Z |
Hermel |
continued cleanup
|
315550908 |
2009-09-22T18:10:31Z |
84.58.213.248 |
cleanup
|
315549991 |
2009-09-22T18:05:40Z |
84.58.213.248 |
continued restructuring
|
315528312 |
2009-09-22T15:58:29Z |
Hermel |
restructuring: move history towards the end of article; compare German article
|
315527141 |
2009-09-22T15:51:52Z |
Hermel |
/* NP completeness and other open questions */ fix heading according to millenium prize description
|
315280944 |
2009-09-21T12:25:50Z |
Hermel |
/* Computational complexity theory topics */ removed section which is now obsolete
|
315279390 |
2009-09-21T12:11:39Z |
Hermel |
removed analysis of algorithms part; {{Translated|de|Komplexitätstheorie}} started translating portions of German article
|
313832275 |
2009-09-14T12:02:16Z |
120.16.79.147 |
/* Hard */ corrected phrase structure in definition
|
312649117 |
2009-09-08T20:20:06Z |
Hermel |
/* See also */ removed sub-topics of the neighboring field "analysis of algorithms"
|
312561370 |
2009-09-08T09:51:12Z |
Pcap |
/* Textbooks and surveys */ add an isbn
|
311593758 |
2009-09-03T03:38:17Z |
DavidSJ |
Let's get it right this time...
|
311593716 |
2009-09-03T03:37:50Z |
DavidSJ |
spelling
|
310576064 |
2009-08-28T17:38:53Z |
D climacus |
Reverted edits by [[Special:Contributions/220.225.67.36|220.225.67.36]] to last revision by RobinK ([[WP:HG|HG]])
|
310575984 |
2009-08-28T17:38:22Z |
220.225.67.36 |
/* Axiomatic analysis */
|
309721778 |
2009-08-24T04:02:59Z |
RobinK |
/* See also */
|
309721502 |
2009-08-24T04:00:26Z |
Citation bot |
Citation maintenance. [U]Unified citation types. You can [[WP:DOI|use this bot]] yourself! Please [[User:DOI_bot/bugs|report any bugs]].
|
309721403 |
2009-08-24T03:59:28Z |
RobinK |
Fixed up references, textbooks/surveys
|
309479179 |
2009-08-22T20:15:12Z |
Pcap |
/* Complexity classes */ space too
|
309478195 |
2009-08-22T20:08:39Z |
Pcap |
/* Complexity classes */ merging a sentence from [[Computation time]], which is now a redirect to [[analysis of algorithms]]
|
308888571 |
2009-08-19T14:54:44Z |
Ink-Jetty |
|
307992124 |
2009-08-14T19:17:29Z |
Jaksmata |
[[WP:EDITORIAL]]
|
307978522 |
2009-08-14T18:04:37Z |
SmackBot |
Date maintenance tags and general fixes
|
307953638 |
2009-08-14T15:36:38Z |
Pcap |
/* Further reading */ hack
|
307950613 |
2009-08-14T15:18:41Z |
Pcap |
/* History */ lol
|
307949828 |
2009-08-14T15:13:41Z |
Pcap |
/* History */{{Prose}}
|
307948921 |
2009-08-14T15:08:22Z |
Pcap |
/* Further reading */ clarify
|
307948813 |
2009-08-14T15:07:41Z |
Pcap |
/* Further reading */ note
|
307948347 |
2009-08-14T15:04:57Z |
Pcap |
No indication what cleanup is needed (the references could use some order). The huge "translate from the German FA" is annoying enough.
|
307381643 |
2009-08-11T16:01:29Z |
Hermel |
/* Decision problems */ fixed omission
|
307381441 |
2009-08-11T16:00:23Z |
Hermel |
/* Decision problems */ improved example, fixed inaccuracies
|
307370534 |
2009-08-11T14:56:11Z |
Hermel |
improved lede
|
307231228 |
2009-08-10T20:26:52Z |
RobinK |
Added a reference for the common belief that NP != co-NP
|
307197275 |
2009-08-10T17:15:04Z |
91.84.187.72 |
/* The NP = co-NP problem */
|
306560528 |
2009-08-07T08:01:14Z |
Numbo3-bot |
robot Adding: [[sh:Računska teorija složenosti]]
|
306393829 |
2009-08-06T12:55:44Z |
RibotBOT |
robot Adding: [[et:Algoritmiline keerukus]]
|
305348827 |
2009-07-31T22:00:34Z |
Wavelength |
/* See also */ adding 1 internal link: *[[Complexity index]] ([[WP:O]])
|
305009621 |
2009-07-30T04:02:28Z |
RobinK |
Added a translation request. The German article is far superior to the English one.
|
299527618 |
2009-06-30T16:08:58Z |
Estirabot |
robot Adding: [[ca:Complexitat computacional]]
|
298865031 |
2009-06-27T02:14:34Z |
The Thing That Should Not Be |
Reverted edits by [[Special:Contributions/124.124.176.134|124.124.176.134]] to last revision by Mik01aj ([[WP:HG|HG]])
|
298864740 |
2009-06-27T02:12:15Z |
124.124.176.134 |
/* Axiomatic analysis */
|
298084937 |
2009-06-23T07:52:46Z |
Mik01aj |
/* NP completeness and other open questions */ +link
|
297529109 |
2009-06-20T11:02:52Z |
Graham87 |
moved [[Complexity theory (computation)]] to [[Computational complexity theory]] over redirect: revert
|
297529010 |
2009-06-20T11:01:39Z |
Graham87 |
moved [[Computational complexity theory]] to [[Complexity theory (computation)]]: history merge
|
297205994 |
2009-06-18T18:26:23Z |
David Newton |
/* See also */ cp
|
296662478 |
2009-06-16T01:06:57Z |
Rubinbot |
robot Modifying: [[fr:Théorie de la complexité des algorithmes]]
|
296646108 |
2009-06-15T23:20:54Z |
Hermel |
/* See also */ improved wording
|
296629602 |
2009-06-15T21:45:48Z |
188.155.46.248 |
/* See also */
|
296629336 |
2009-06-15T21:44:18Z |
188.155.46.248 |
/* Big O notation */
|
294804076 |
2009-06-06T16:27:47Z |
SmackBot |
Date maintenance tags and general fixes
|
294683520 |
2009-06-05T23:49:43Z |
Miym |
tagging for clean-up; the high-level structure of the page needs some work...
|
294683070 |
2009-06-05T23:47:08Z |
Miym |
/* Worst case analysis */ links
|
294682378 |
2009-06-05T23:43:17Z |
Miym |
move and fix link
|
294680720 |
2009-06-05T23:33:40Z |
Miym |
/* Resources */ rm boldface
|
294680153 |
2009-06-05T23:30:27Z |
Miym |
/* Incomplete */ "P = NP is found false" -> "P ≠ NP"
|
294679943 |
2009-06-05T23:29:24Z |
Miym |
/* Incomplete */ removing "citation needed", there are references in the same sentence
|
294679094 |
2009-06-05T23:24:39Z |
Miym |
HTML math
|
294676450 |
2009-06-05T23:09:18Z |
Miym |
/* Example */ delete strange section
|
294447723 |
2009-06-04T20:50:14Z |
Eser.aygun |
|
292688041 |
2009-05-27T15:57:44Z |
Altenmann |
/* Cheer up, it could be worse */
|
292687944 |
2009-05-27T15:57:12Z |
Altenmann |
/* Graph theory */ rm irrelevant section
|
292051320 |
2009-05-24T17:53:21Z |
117.96.86.78 |
/* Example */
|
291845352 |
2009-05-23T17:42:10Z |
Pichpich |
/* Axiomatic analysis */ fix stuff
|
291843774 |
2009-05-23T17:33:10Z |
Pichpich |
/* Intractability */ trying to make it clearer
|
291839974 |
2009-05-23T17:11:37Z |
Pichpich |
/* Intractability */ rmv nonsense: the age of the universe divided by a million is still a pretty long time...
|
291690228 |
2009-05-22T20:55:00Z |
Rich Farmbrough |
clean up- spelling "et al." and gen fixes
|
291198248 |
2009-05-20T15:54:02Z |
132.66.231.88 |
/* Further reading */
|
290296970 |
2009-05-16T12:02:46Z |
WikHead |
Fixed typo, "of of"
|
289416493 |
2009-05-12T07:22:22Z |
169.232.107.94 |
/* Intractability */
|
289190776 |
2009-05-11T04:09:29Z |
Dmyersturnbull |
Added link and fixed comma.
|
288724801 |
2009-05-08T18:52:32Z |
Alotau |
/* Complete */ Removed "why?" tag and added a brief explanation.
|
284885661 |
2009-04-19T21:50:37Z |
SmackBot |
Date maintenance tags and general fixes
|
284008937 |
2009-04-15T15:19:44Z |
Citation bot |
Citation maintenance. Formatted: edition, pages, doi. You can [[WP:UCB|use this bot]] yourself! Please [[User:DOI_bot/bugs|report any bugs]].
|
281548357 |
2009-04-03T18:44:36Z |
SmackBot |
Date maintenance tags and general fixes
|
281459258 |
2009-04-03T07:48:47Z |
83.248.97.76 |
|
281282448 |
2009-04-02T12:54:05Z |
C. lorenz |
/* Resources */ A complexity class is both a class and a set, one arguably more specific than the other
|
281234763 |
2009-04-02T05:36:50Z |
94.79.211.5 |
/* Resources */
|
280917329 |
2009-03-31T19:05:35Z |
212.78.188.37 |
/* Axiomatic analysis */ It is, so far, not shown that the question P=?NP is unsolvable. Also according to the main article on P=NP and NP-Complete.
|
280422496 |
2009-03-29T14:32:46Z |
78.37.152.185 |
/* Further reading */
|
279688623 |
2009-03-25T23:05:50Z |
McKay |
/* Decision problems */ remove incorrect statement. this section needs a complete rewrite.
|
279634027 |
2009-03-25T18:28:32Z |
201.250.106.62 |
/* Decision problems */
|
279153718 |
2009-03-23T14:28:30Z |
192.100.124.218 |
/* Axiomatic analysis */
|
279123587 |
2009-03-23T10:45:25Z |
McKay |
/* The NP=co-NP problem */ P \subseteq NP\cap co-NP
|
279123140 |
2009-03-23T10:41:53Z |
McKay |
unmath a subsection heading
|
278073154 |
2009-03-18T10:32:07Z |
193.136.140.80 |
|
277986242 |
2009-03-17T23:45:09Z |
SimonTrew |
Simplified and also added a bit about termination condition.
|
277985497 |
2009-03-17T23:41:12Z |
SimonTrew |
Reverted changes around math tags. Not my fault if your browser renders them badly-- one of the big subs I did was for consistency
|
277965030 |
2009-03-17T22:02:42Z |
SmackBot |
Date maintenance tags and general fixes
|
277902753 |
2009-03-17T17:18:16Z |
Van Parunak |
corrected typo
|
277875766 |
2009-03-17T15:12:35Z |
Giftlite |
/* NP = co-NP */ wikify
|
277872475 |
2009-03-17T14:57:24Z |
Jitse Niesen |
/* Axiomatic analysis */ wikisyntax
|
277848618 |
2009-03-17T12:21:05Z |
Adavidb |
/* Complexity classes */ spacing
|
277848561 |
2009-03-17T12:20:36Z |
Adavidb |
/* Complexity classes */ del non-applicable style tag
|
277848405 |
2009-03-17T12:19:14Z |
Adavidb |
/* Complexity classes */ del orphaned style tag
|
277847284 |
2009-03-17T12:09:54Z |
Adavidb |
/* History */ more cleanup
|
277846307 |
2009-03-17T12:02:21Z |
Adavidb |
/* History */ publication-place → location
|
277845847 |
2009-03-17T11:58:35Z |
Adavidb |
/* History */ some minor cleanup
|
277798719 |
2009-03-17T04:14:17Z |
SimonTrew |
Aded thumb index.
|
277796017 |
2009-03-17T03:53:46Z |
SimonTrew |
Subbed of my own minor changes. Looking quite nice though, though no doubt still many faults. Anonymous user decided to do a small sub while I was working on it so have to merge.
|
277788613 |
2009-03-17T02:59:26Z |
74.192.171.208 |
/* Example */ getting rid of </sup>
|
277785793 |
2009-03-17T02:40:40Z |
SimonTrew |
Okay gonna save this before I even check it after big edit. Don't want to lose it. If anyone is actually watching it then feel free to revert.
|
273017526 |
2009-02-24T19:17:38Z |
Twri |
/* Overview */ introduced the term "worst-case" ; see also talk page
|
272727781 |
2009-02-23T15:02:10Z |
Mycer1nus |
|
272243723 |
2009-02-21T10:56:18Z |
Gail |
Reverted edits by [[Special:Contributions/66.240.27.50|66.240.27.50]] to last revision by ClueBot ([[WP:HG|HG]])
|
272243710 |
2009-02-21T10:56:06Z |
66.240.27.50 |
/* Overview */
|
272243530 |
2009-02-21T10:54:32Z |
ClueBot |
Reverting possible vandalism by [[Special:Contributions/66.240.27.50|66.240.27.50]] to version by 75.16.87.85. False positive? [[User:ClueBot/FalsePositives|Report it]]. Thanks, [[User:ClueBot|ClueBot]]. (595755) (Bot)
|
272243525 |
2009-02-21T10:54:27Z |
66.240.27.50 |
/* Overview */
|
271972069 |
2009-02-20T01:39:46Z |
75.16.87.85 |
/* Time and space complexity */
|
270284930 |
2009-02-12T20:02:26Z |
Battamer |
/* Time and space complexity */
|
270283551 |
2009-02-12T19:55:51Z |
Battamer |
/* Time and space complexity */ Clarified big O summarization
|
270085616 |
2009-02-11T21:43:29Z |
Wikiklrsc |
Primes is in P paper and work
|
270080699 |
2009-02-11T21:20:42Z |
Wikiklrsc |
move reference etc.
|
270076181 |
2009-02-11T21:00:33Z |
Wikiklrsc |
/* External links */ fix links
|
270075392 |
2009-02-11T20:56:31Z |
Wikiklrsc |
/* Further reading */ fix refs
|
270073518 |
2009-02-11T20:47:46Z |
Wikiklrsc |
/* Further reading */ add Mertens paper
|
268644588 |
2009-02-05T07:05:21Z |
Robbot |
robot Adding: [[ms:Teori kekompleksan pengiraan]]
|
265972161 |
2009-01-23T19:55:39Z |
132.217.93.115 |
/* NP = co-NP */ Punctuation
|
263051749 |
2009-01-09T21:34:23Z |
VictorAnyakin |
/* External links */ +interwiki->uk
|
262746827 |
2009-01-08T13:49:21Z |
130.192.50.83 |
/* NP = co-NP */
|
261855759 |
2009-01-04T08:21:09Z |
86.168.236.83 |
/* See also - sort to alphabetic order, add link to algorithmic efficiency*/
|
259490703 |
2008-12-22T07:31:04Z |
140.180.4.209 |
grammaire omg
|
259490536 |
2008-12-22T07:29:23Z |
140.180.4.209 |
ponctuation
|
259326648 |
2008-12-21T10:58:19Z |
85.146.213.137 |
/* External links */
|
257920906 |
2008-12-14T15:53:00Z |
78.131.38.236 |
/* NP = co-NP */
|
257253089 |
2008-12-11T10:49:16Z |
Cngoulimis |
/* Intractability */ added graph about empirical behaviour on knapsack problem
|
256831014 |
2008-12-09T13:59:11Z |
Hiihammuk |
/* See also */
|
256830652 |
2008-12-09T13:56:18Z |
Hiihammuk |
/* See also */
|
255075185 |
2008-11-30T22:23:34Z |
Citation bot |
Updating page numbers after [[Template_talk:Cite_book#Ready_to_go|recent improvement]] to [[Template:Cite book]]. Removed redundant parameters.
|
254490301 |
2008-11-27T21:27:54Z |
C. lorenz |
/* Overview */ Link to Blum axioms.
|
253031685 |
2008-11-20T18:59:07Z |
85.58.17.192 |
/* Intractability */
|
252661361 |
2008-11-18T22:39:54Z |
84.250.48.191 |
[[WP:UNDO|Undid]] revision 252378944 by [[Special:Contributions/121.1.53.46|121.1.53.46]] ([[User talk:121.1.53.46|talk]])
|
252378944 |
2008-11-17T15:49:34Z |
121.1.53.46 |
/* Decision problems */
|
249926567 |
2008-11-05T22:49:42Z |
Pascal.Tesson |
Reverted edits by [[Special:Contributions/71.221.53.18|71.221.53.18]] ([[User talk:71.221.53.18|talk]]) to last version by D.scain.farenzena
|
249925334 |
2008-11-05T22:42:56Z |
71.221.53.18 |
/* Overview */
|
245276710 |
2008-10-14T19:00:10Z |
D.scain.farenzena |
"Parameterized complexity" had the first letter on "complexity" captionized, so it got lost on finding the correct wikipedia article.
|
245202281 |
2008-10-14T11:41:15Z |
Graham87 |
moved [[Complexity theory in computation]] to [[Computational complexity theory]] over redirect: revert
|
245202165 |
2008-10-14T11:40:22Z |
Graham87 |
moved [[Computational complexity theory]] to [[Complexity theory in computation]]: history merge
|
245095453 |
2008-10-13T22:30:32Z |
Robbot |
robot Adding: [[sk:Teória zložitosti]]
|
243558159 |
2008-10-07T00:52:08Z |
Bassbonerocks |
Reverted edits by [[Special:Contributions/133.68.126.133|133.68.126.133]] to last version by Talldean ([[WP:HG|HG]])
|
243558099 |
2008-10-07T00:51:46Z |
133.68.126.133 |
/* History */
|
241179698 |
2008-09-26T18:38:34Z |
Talldean |
/* Intractability */ Removed air quotes around "in practice"; quotations aren't used for emphasis.
|
239718940 |
2008-09-20T03:19:37Z |
Hegariz |
/* History */ added wiki link
|
234133942 |
2008-08-25T13:44:37Z |
ClueBot |
Reverting possible vandalism by [[Special:Contributions/82.42.62.245|82.42.62.245]] to version by P3d0. False positive? [[User:ClueBot/FalsePositives|Report it]]. Thanks, [[User:ClueBot]]. (470140) (Bot)
|
234133933 |
2008-08-25T13:44:32Z |
82.42.62.245 |
[[WP:AES|←]] Replaced content with 'If I was a beginner looking at understanding this subject, I wouldn't have a fucking clue what it was about.'
|
232998280 |
2008-08-19T22:41:39Z |
Doradus |
rv. It is not obvious that they are disjoint just because they are unequal
|
232821089 |
2008-08-19T02:42:54Z |
204.15.21.171 |
/* NP = co-NP */ "it has been shown" inappropriate for just an obvious restatement
|
230614112 |
2008-08-08T14:07:56Z |
SieBot |
robot Modifying: [[fa:نظریه پیچیدگی محاسباتی]]
|
228238365 |
2008-07-27T19:22:18Z |
Waltnmi |
|
228237981 |
2008-07-27T19:19:46Z |
Waltnmi |
typo
|
228237812 |
2008-07-27T19:18:46Z |
Waltnmi |
added Parameterized Complexity
|
228235893 |
2008-07-27T19:06:56Z |
Waltnmi |
add reference
|
228223890 |
2008-07-27T17:54:35Z |
Waltnmi |
/* See also */
|
228223435 |
2008-07-27T17:51:56Z |
Waltnmi |
|
228223172 |
2008-07-27T17:50:20Z |
Waltnmi |
/* References */
|
227606032 |
2008-07-24T11:12:52Z |
Philip Trueman |
Reverted edits by [[Special:Contributions/210.212.49.29|210.212.49.29]] ([[User talk:210.212.49.29|talk]]) to last version by Epbr123
|
227605981 |
2008-07-24T11:12:35Z |
210.212.49.29 |
/* Time and space complexity */
|
225829245 |
2008-07-15T16:19:58Z |
Epbr123 |
Reverted edits by [[Special:Contributions/OrgasGirl|OrgasGirl]] to last version by 75.36.151.182 (using [[WP:HG|Huggle]])
|
225828097 |
2008-07-15T16:16:36Z |
OrgasGirl |
|
225318940 |
2008-07-13T01:56:12Z |
75.36.151.182 |
Added link to Axiomatic system
|
224975064 |
2008-07-11T07:26:36Z |
JAnDbot |
robot Modifying: [[fa:نظریه پیچیدگی محاسباتی]]
|
223407615 |
2008-07-03T23:10:30Z |
Mdd |
wikification
|
223407263 |
2008-07-03T23:08:35Z |
Mdd |
Wikification
|
223398375 |
2008-07-03T22:22:06Z |
Multipundit |
|
223397288 |
2008-07-03T22:16:29Z |
Multipundit |
|
223395903 |
2008-07-03T22:09:16Z |
Multipundit |
/* References */
|
222173855 |
2008-06-27T22:37:18Z |
Multipundit |
|
221958926 |
2008-06-26T21:37:23Z |
Multipundit |
|
221531088 |
2008-06-24T22:31:09Z |
Multipundit |
/* History */
|
221528234 |
2008-06-24T22:13:47Z |
Multipundit |
|
221525054 |
2008-06-24T21:56:08Z |
Multipundit |
|
219142504 |
2008-06-13T19:40:09Z |
DOI bot |
Citation maintenance. Initiated by [[User:Fconaway|Fconaway]]. You can [[WP:DOI|use this bot]] yourself! Please [[User:DOI_bot/bugs|report any bugs]].
|
214962103 |
2008-05-26T02:35:03Z |
Faradayplank |
Reverted 4 edits by [[Special:Contributions/71.188.63.120|71.188.63.120]] to last version by SmackBot
|
214961862 |
2008-05-26T02:33:21Z |
71.188.63.120 |
|
214961816 |
2008-05-26T02:33:01Z |
71.188.63.120 |
|
214961650 |
2008-05-26T02:31:59Z |
71.188.63.120 |
|
214961228 |
2008-05-26T02:29:38Z |
71.188.63.120 |
|
212061751 |
2008-05-13T07:45:54Z |
SmackBot |
Date the maintenance tags and general fixes
|
211969713 |
2008-05-12T22:00:14Z |
Chealer |
/* Intractability */ Problems that are solvable in theory, but cannot be solved in practice, are called ''intractable''.{{fact}}
|
211315351 |
2008-05-09T19:13:11Z |
SpBot |
robot Removing: [[tr:Karmaşık Teorem]]
|
207575153 |
2008-04-23T10:50:56Z |
Klausness |
"on the order of" is correct
|
207525174 |
2008-04-23T03:42:16Z |
71.126.57.201 |
/* Overview */
|
205341309 |
2008-04-13T15:29:50Z |
Tkgd2007 |
removed self-ref
|
204235675 |
2008-04-08T15:51:12Z |
Skippydo |
undo: no actually, it's a lower bound. Omega is correct. Note: sqrt n\in O(n)-\Omega(n)
|
204224207 |
2008-04-08T14:53:37Z |
Drizzd~enwiki |
[[WP:UNDO|Undid]] revision 204174179 by [[Special:Contributions/Dmitri pavlov|Dmitri pavlov]] ([[User talk:Dmitri pavlov|talk]]): It's O(n), not \Omega(n)
|
204174179 |
2008-04-08T08:04:45Z |
Dmitri pavlov |
/* History */
|
204135844 |
2008-04-08T02:49:58Z |
Grsbmd |
link to manuel blum
|
203038036 |
2008-04-03T13:26:34Z |
Andrei Stroe |
iw ro
|
202954809 |
2008-04-03T02:20:09Z |
Multipundit |
|
202945734 |
2008-04-03T01:33:47Z |
131.179.64.216 |
|
194598628 |
2008-02-28T05:37:07Z |
Getonyourfeet |
move topic further left in leadin... move portal box to see also section
|
191081682 |
2008-02-13T05:48:35Z |
Chobot |
robot Adding: [[fi:Aikavaativuusluokka]]
|
190209097 |
2008-02-09T17:33:14Z |
16@r |
bypassing redirect
|
184433565 |
2008-01-15T06:14:04Z |
Groupthink |
[[WP:UNDO|Undid]] revision 184433150 by [[Special:Contributions/Scottcraig|Scottcraig]] ([[User talk:Scottcraig|talk]])
|
184433150 |
2008-01-15T06:10:59Z |
Scottcraig |
Restores definition from October 17, 2007 and previous (se talk)
|
184344529 |
2008-01-14T22:02:25Z |
ArnoldReinhold |
restore prev def, see talk
|
184302130 |
2008-01-14T18:42:23Z |
Scottcraig |
|
184060198 |
2008-01-13T16:29:32Z |
88.229.226.114 |
/* External links */
|
183513052 |
2008-01-10T23:41:19Z |
PixelBot |
robot Adding: [[simple:Computational complexity theory]]
|
176265217 |
2007-12-07T00:17:08Z |
62.57.1.175 |
'Classses' => 'classes'
|
175708818 |
2007-12-04T14:36:44Z |
131.220.4.212 |
/* History */ added Marek Karpinski
|
175613724 |
2007-12-04T00:56:34Z |
Erudecorp |
/* See also */ Programming Complexity --> Cyclomatic Complexity
|
175534094 |
2007-12-03T18:31:41Z |
Tim32 |
/* References */
|
175161436 |
2007-12-02T00:22:26Z |
Dissident |
strict subset
|
174255327 |
2007-11-28T00:16:34Z |
Erudecorp |
/* See also */ programming complexity
|
173841144 |
2007-11-26T06:30:39Z |
Walkerma |
/* References */ Separate out the inline from the general references
|
173792208 |
2007-11-26T01:07:16Z |
Linas |
/* History */ mention divide an conquer
|
173790998 |
2007-11-26T01:00:42Z |
Linas |
/* Researchers that have laid the foundations of the computational complexity theory */ Kolmogorov
|
168868002 |
2007-11-03T02:34:53Z |
91.65.218.118 |
/* Incomplete problems in NP */
|
168491718 |
2007-11-01T12:06:52Z |
Triwas |
|
167673113 |
2007-10-28T18:32:49Z |
Jlpinar83 |
/* Open questions */
|
166977068 |
2007-10-25T13:49:14Z |
DragonBot |
robot Adding: [[bn:গণনামূলক জটিলতা তত্ত্ব]]
|
165651665 |
2007-10-19T16:04:14Z |
71.206.231.116 |
spelling fix
|
165431224 |
2007-10-18T16:17:06Z |
67.132.195.88 |
|
165293103 |
2007-10-17T23:24:47Z |
Altenmann |
/* Notable researchers */
|
165289435 |
2007-10-17T23:05:07Z |
Altenmann |
/* Notable researchers */
|
165289079 |
2007-10-17T23:03:02Z |
Altenmann |
fix nonsense intro, rm essayish pieces & expand a bit
|
165243983 |
2007-10-17T19:26:14Z |
Mpatel |
/* The P = NP question */ rejigged and included relevant MPP link
|
164919007 |
2007-10-16T09:37:46Z |
DerGraph~enwiki |
/* Overview */
|
162445064 |
2007-10-05T12:40:21Z |
Pascal.Tesson |
/* Notable researchers */ Wolfram has not made an impact in ''this'' kind of complexity theory
|
162388994 |
2007-10-05T03:25:31Z |
216.165.49.159 |
|
161865929 |
2007-10-02T20:31:23Z |
212.32.85.85 |
hyphen -> endash // link directly to the reference PDF paper // USD -> US$ per [[WP:DATE]]
|
161759309 |
2007-10-02T10:16:46Z |
Groupthink |
[[WP:UNDO|Undid]] revision 161750296 by [[Special:Contributions/203.97.214.12|203.97.214.12]] ([[User talk:203.97.214.12|talk]])
|
161750296 |
2007-10-02T08:43:13Z |
203.97.214.12 |
/* Open questions */
|
159500441 |
2007-09-21T23:53:18Z |
Dcoetzee |
Fix link in {{see also}}
|
158649506 |
2007-09-18T03:54:05Z |
DHN-bot~enwiki |
robot Adding: [[vi:Độ phức tạp thuật toán]]
|
157161612 |
2007-09-11T14:50:16Z |
Robbot |
robot Modifying: [[el:Θεωρία πολυπλοκότητας]]
|
155699100 |
2007-09-04T20:40:25Z |
70.242.135.254 |
/* The P<nowiki> = NP question */ rewrite a bit.</nowiki>
|
154395690 |
2007-08-29T14:45:12Z |
CharlesGillingham |
Adding a connection to combinatorial explosion
|
151996141 |
2007-08-18T07:14:21Z |
Siddhant |
copy edit
|
151534543 |
2007-08-16T03:53:23Z |
76.226.100.116 |
+fa
|
147413752 |
2007-07-27T09:10:08Z |
141.20.24.116 |
/* Incomplete problems in ''NP'' */
|
147413705 |
2007-07-27T09:09:38Z |
141.20.24.116 |
/* Incomplete problems in ''NP'' */
|
143001679 |
2007-07-06T23:59:50Z |
216.31.255.3 |
/* Notable researchers */
|
142830030 |
2007-07-06T05:21:05Z |
Groupthink |
/* See also */ adding link
|
142780980 |
2007-07-05T23:49:20Z |
Obradovic Goran |
[[sr:Теорија комплексности]]
|
140727151 |
2007-06-26T12:17:20Z |
Anchor Link Bot |
Notifying of internal link to section [[Computational complexity theory#Intractability|Intractability]] from [[Minimax]]
|
138590870 |
2007-06-16T17:33:11Z |
GregorB |
/* Notable researchers */ Larger font
|
138590792 |
2007-06-16T17:32:41Z |
GregorB |
/* Intractability */ ×
|
137777043 |
2007-06-12T22:52:36Z |
Henning Makholm |
Remove {{TOCleft}}; no particular reason to have it here
|
137689671 |
2007-06-12T15:09:18Z |
Giftlite |
/* Notable researchers */ partition list
|
137687899 |
2007-06-12T14:58:41Z |
Beland |
/* Overview */ "on the order of"
|
136411246 |
2007-06-06T18:42:10Z |
Intgr |
revert: not related to the article's subject and not very helpful
|
136387914 |
2007-06-06T16:52:36Z |
Magmi |
|
136052422 |
2007-06-05T13:33:56Z |
ArnoldReinhold |
add example, copy edit
|
136042899 |
2007-06-05T12:26:42Z |
ArnoldReinhold |
/* Intractability */ rewrite
|
136041121 |
2007-06-05T12:11:18Z |
ArnoldReinhold |
/* The P<nowiki> = NP question */ rm nonsense about cryptography</nowiki>
|
132538474 |
2007-05-21T21:59:20Z |
Tarotcards |
a -> an
|
132152392 |
2007-05-20T04:35:41Z |
Stevenmitchell |
elucidated a question
|
130740068 |
2007-05-14T09:09:23Z |
JRSpriggs |
rvv to Oleg's version
|
130735832 |
2007-05-14T08:34:01Z |
203.200.160.237 |
/* Overview */
|
130735798 |
2007-05-14T08:33:39Z |
203.200.160.237 |
/* Decision problems */
|
130735712 |
2007-05-14T08:32:58Z |
203.200.160.237 |
/* Incomplete problems in ''NP'' */
|
130735674 |
2007-05-14T08:32:40Z |
203.200.160.237 |
/* The P<nowiki> = NP question */</nowiki>
|
130552183 |
2007-05-13T15:28:00Z |
Oleg Alexandrov |
rm poor quality {{Numerical Algorithms}} as discussed at [[Wikipedia_talk:WikiProject_Mathematics#Template:Numerical_algorithms]]
|
128726002 |
2007-05-06T19:58:00Z |
Egriffin |
/* Notable researchers */ Changed one of the links to skip the disambiguation page.
|
128426982 |
2007-05-05T14:09:00Z |
Decrease789 |
/* External links */
|
128425191 |
2007-05-05T13:56:20Z |
Decrease789 |
|
125824877 |
2007-04-25T13:21:28Z |
161.53.241.73 |
+ [[hr:Računska teorija složenosti]]
|
123453064 |
2007-04-17T05:07:42Z |
Ben Standeven |
/* Intractability */ no need to mention SI prefixes here.
|
120020335 |
2007-04-03T17:41:52Z |
Intgr |
rv: Why not age of the universe? If you have a good reason, please bring up in talk first
|
119993401 |
2007-04-03T15:42:22Z |
213.190.46.52 |
/* Intractability */
|
119993127 |
2007-04-03T15:41:02Z |
213.190.46.52 |
/* Intractability */
|
119750530 |
2007-04-02T16:35:33Z |
Pascal.Tesson |
Revert to revision 119667765 dated 2007-04-02 07:04:15 by Bouke using [[:en:Wikipedia:Tools/Navigation_popups|popups]]
|
119726069 |
2007-04-02T14:38:05Z |
GPhilip |
/* External links */
|
119667765 |
2007-04-02T07:04:15Z |
Bouke~enwiki |
removed incorrect wording
|
119418691 |
2007-04-01T04:28:12Z |
Roboto de Ajvol |
robot Adding: [[ru:Теория сложности вычислений]]
|
119302176 |
2007-03-31T17:38:45Z |
Ruud Koot |
~[[ar:نظرية التعقيد الحسابي]]
|
119292256 |
2007-03-31T16:45:35Z |
Ruud Koot |
Reverted edits by [[Special:Contributions/FANSTARbot|FANSTARbot]] ([[User talk:FANSTARbot|talk]]) to last version by Pascal.Tesson
|
119289113 |
2007-03-31T16:28:20Z |
FANSTARbot |
robot Removing: [[ar:نظرية التعقيد]]
|
119135480 |
2007-03-30T21:43:35Z |
Pascal.Tesson |
/* Notable researchers */ rmv professor not working in this area
|
119125750 |
2007-03-30T20:57:54Z |
143.239.68.65 |
/* Notable researchers */
|
118815326 |
2007-03-29T16:56:23Z |
Blokhead |
/* Incomplete problems in ''NP'' */ fix Ladner's name
|
117462063 |
2007-03-24T05:27:09Z |
Everyking |
/* The P<nowiki> = NP question */</nowiki>
|
115552211 |
2007-03-16T13:46:02Z |
Harryboyles |
clean up using [[Project:AWB|AWB]]
|
115249435 |
2007-03-15T04:41:14Z |
Shenme |
Revert to revision 115163951 dated 2007-03-14 21:40:36 by Pascal.Tesson using [[:en:Wikipedia:Tools/Navigation_popups|popups]]
|
115249259 |
2007-03-15T04:40:05Z |
203.91.207.30 |
|
115248998 |
2007-03-15T04:38:16Z |
203.91.207.30 |
|
115248921 |
2007-03-15T04:37:41Z |
203.91.207.30 |
|
115163951 |
2007-03-14T21:40:36Z |
Pascal.Tesson |
/* Intractability */ changing it a bit and removing last sentence (which is entirely missing the point)
|
115159979 |
2007-03-14T21:25:30Z |
195.216.176.150 |
/* Intractability */
|
114456487 |
2007-03-12T03:32:16Z |
Ruud Koot |
Reverted edits by [[Special:Contributions/61.95.189.128|61.95.189.128]] ([[User talk:61.95.189.128|talk]]) to last version by Ruud Koot
|
114453334 |
2007-03-12T03:14:57Z |
61.95.189.128 |
/* Notable researchers */
|
113895861 |
2007-03-09T19:31:20Z |
Ruud Koot |
+
|
113828482 |
2007-03-09T13:52:58Z |
JAnDbot |
robot Removing: [[ar:نظرية التعقيد]] Modifying: [[it:Teoria della complessità computazionale]]
|
110836534 |
2007-02-25T15:15:34Z |
Intgr |
Revert to revision 110570351 dated 2007-02-24 12:36:51 by Pascal.Tesson using [[:en:Wikipedia:Tools/Navigation_popups|popups]]
|
110831525 |
2007-02-25T14:38:18Z |
210.212.113.10 |
|
110570351 |
2007-02-24T12:36:51Z |
Pascal.Tesson |
revert last two
|
110527978 |
2007-02-24T06:37:49Z |
128.122.89.43 |
/* Notable researchers */
|
110527512 |
2007-02-24T06:33:41Z |
128.122.89.43 |
/* Overview */
|
105789185 |
2007-02-05T13:19:59Z |
Intgr |
/* Complexity classes */ caps
|
105205348 |
2007-02-02T22:56:53Z |
Jeff Dahl |
|
104052007 |
2007-01-29T09:53:36Z |
65.121.197.34 |
typo/reverse->reverses
|
104051540 |
2007-01-29T09:49:44Z |
65.121.197.34 |
typo/vandalism
|
104046561 |
2007-01-29T09:06:59Z |
202.128.26.31 |
|
102865217 |
2007-01-24T08:37:12Z |
136.152.145.17 |
/* Complexity classes */
|
101454147 |
2007-01-18T00:32:24Z |
Droll |
fixed broken {{cite book}} syntax
|
101289263 |
2007-01-17T08:32:32Z |
66.16.28.52 |
Changed what appeared to be a simple grammatical error.
|
97560930 |
2006-12-31T16:42:28Z |
Ekotkie |
isbn length
|
96092848 |
2006-12-23T12:21:59Z |
SmackBot |
ISBN formatting inc.10->13 (see [[ISBN]])/gen fixes using [[Project:AWB|AWB]]
|
95408238 |
2006-12-19T23:44:46Z |
SmackBot |
ISBN formatting/gen fixes using [[Project:AWB|AWB]]
|
93091301 |
2006-12-09T05:01:06Z |
Kurykh |
clean up and [[WP:AWB/T|Typo fixing]] Typos: 1000's → 1000s, using [[Project:AWB|AWB]]
|
92768693 |
2006-12-07T20:25:39Z |
Pascal.Tesson |
Revert to revision 92658767 dated 2006-12-07 08:21:45 by Booyabazooka using [[:en:Wikipedia:Tools/Navigation_popups|popups]]
|
92764476 |
2006-12-07T20:06:52Z |
80.162.31.56 |
/* References */
|
92658767 |
2006-12-07T08:21:45Z |
Chris-martin |
/* Incomplete problems in ''NP'' */ svg replacement
|
92214981 |
2006-12-05T13:13:19Z |
Pascal.Tesson |
Revert to revision 91658528 dated 2006-12-02 21:40:20 by Christer.berg using [[:en:Wikipedia:Tools/Navigation_popups|popups]]
|
92197796 |
2006-12-05T10:32:36Z |
202.144.91.188 |
/* Decision problems */
|
91658528 |
2006-12-02T21:40:20Z |
Christer.berg |
/* Notable researchers */
|
91568495 |
2006-12-02T10:21:58Z |
41.241.70.31 |
/* Overview */ moved time complexity example to directly follow time complexity explanation
|
89303534 |
2006-11-21T21:05:22Z |
Pascal.Tesson |
/* Overview */ Not sure why one would insist on NOT having this wikilink
|
89294085 |
2006-11-21T20:17:58Z |
128.105.7.15 |
/* Decision problems */
|
89293836 |
2006-11-21T20:16:46Z |
128.105.7.15 |
/* Overview */
|
89293646 |
2006-11-21T20:15:47Z |
128.105.7.15 |
/* Overview */
|
89293461 |
2006-11-21T20:14:48Z |
Pascal.Tesson |
/* Overview */ wikify
|
89292584 |
2006-11-21T20:10:06Z |
128.105.7.15 |
/* Overview */
|
89006466 |
2006-11-20T13:41:15Z |
Bot-Schafter |
Featured article link for [[de:Komplexitätstheorie]]
|
88791382 |
2006-11-19T11:37:25Z |
Arthaey |
/* Decision problems */
|
88014481 |
2006-11-15T17:10:09Z |
Young Pioneer |
FA de
|
87583968 |
2006-11-13T18:49:56Z |
Omicronpersei8 |
/* The P<nowiki> = NP question */ Syntax, wording</nowiki>
|
86734949 |
2006-11-09T16:11:27Z |
Pascal.Tesson |
revert. It is sensible to link to a version of the document which is available from the authors' website.
|
86715740 |
2006-11-09T14:25:10Z |
141.84.9.33 |
/* References */
|
84438429 |
2006-10-29T16:23:03Z |
Larry laptop |
Revert to the revision prior to revision 84438132 dated 2006-10-29 16:21:13 by ConceptExp using [[:en:Wikipedia:Tools/Navigation_popups|popups]]
|
84438313 |
2006-10-29T16:22:21Z |
Larry laptop |
/* External links */ - this is not difficult to understand, your link is not that of a notable site and should be removed.
|
84438132 |
2006-10-29T16:21:13Z |
ConceptExp |
/* External links */
|
83952995 |
2006-10-27T00:20:23Z |
Deflagg |
|
83629522 |
2006-10-25T13:17:00Z |
160.114.36.36 |
/* ''NP''<nowiki> = co-NP */</nowiki>
|
83446317 |
2006-10-24T16:16:07Z |
Readams |
remove confusing big o notation reference
|
83227256 |
2006-10-23T16:10:21Z |
Four Dog Night |
/* Notable researchers */ add Shamir
|
83205516 |
2006-10-23T13:58:53Z |
72.95.153.166 |
/* Notable researchers */
|
82171995 |
2006-10-18T08:36:09Z |
Konstable |
adding more wikilinks to intro, some re-wording (avoiding repetition, more details of this is futher down in the article)
|
82154955 |
2006-10-18T05:35:46Z |
Konstable |
more fixes to new refs
|
82154368 |
2006-10-18T05:29:57Z |
Konstable |
/* The P<nowiki> = NP question */ fix</nowiki>
|
82154261 |
2006-10-18T05:28:55Z |
Konstable |
/* The P<nowiki> = NP question */ info on implications of solving this problem (part taken from Complexity classes P and NP#Consequences of proof)</nowiki>
|
82035180 |
2006-10-17T17:58:41Z |
Scottcraig |
Another new introduction
|
81741860 |
2006-10-16T06:31:40Z |
131.181.251.66 |
/* Incomplete problems in ''NP'' */
|
81200540 |
2006-10-13T12:53:47Z |
Konstable |
/* Decision problems */ some re-wording
|
80965544 |
2006-10-12T06:53:32Z |
84.100.99.180 |
|
80403516 |
2006-10-09T12:22:10Z |
Pascal.Tesson |
/* External links */ Linking to the Arora-Barak book
|
80402329 |
2006-10-09T12:11:47Z |
Pascal.Tesson |
motivate use of asymptotic notation
|
80383529 |
2006-10-09T09:09:22Z |
Konstable |
/* The P<nowiki> = NP question */ trim see also</nowiki>
|
80382455 |
2006-10-09T08:58:01Z |
203.173.167.216 |
re-wrote intro
|
80377606 |
2006-10-09T08:02:09Z |
Konstable |
/* The P<nowiki> = NP question */</nowiki>
|
80190527 |
2006-10-08T11:09:47Z |
Konstable |
/* External links */ brief description
|
80190149 |
2006-10-08T11:05:27Z |
Konstable |
moved image, standardized citation
|
80188795 |
2006-10-08T10:48:16Z |
Konstable |
/* The P<nowiki> = NP question */ image and caption, copied from Complexity classes P and NP</nowiki>
|
79957807 |
2006-10-07T01:46:36Z |
Konstable |
expanding
|
79705349 |
2006-10-05T19:43:32Z |
SmackBot |
ISBN formatting/gen fixes using [[WP:AWB|AWB]]
|
79597701 |
2006-10-05T05:21:01Z |
Konstable |
Reverted edits by [[Special:Contributions/70.64.168.55|70.64.168.55]] ([[User talk:70.64.168.55|talk]]) to last version by Konstable
|
79596948 |
2006-10-05T05:13:43Z |
70.64.168.55 |
|
78465321 |
2006-09-29T08:25:43Z |
Konstable |
rm some duplicate statements and some other minor re-working
|
78288113 |
2006-09-28T11:54:36Z |
Konstable |
/* References */ +<references/>
|
78288008 |
2006-09-28T11:53:40Z |
Konstable |
/* The P<nowiki> = NP question */ re-wrote the section</nowiki>
|
78274385 |
2006-09-28T09:27:29Z |
WikiSlasher |
Capitalised Computer in portal link
|
78226879 |
2006-09-28T02:07:33Z |
CRGreathouse |
/* The P<nowiki> = NP question */</nowiki>
|
78205052 |
2006-09-27T23:51:11Z |
210.94.41.89 |
/* Overview */
|
77117915 |
2006-09-22T04:47:23Z |
203.129.194.20 |
/* Computational resources */
|
77117649 |
2006-09-22T04:44:52Z |
203.129.194.20 |
/* Overview */
|
76877496 |
2006-09-20T22:41:46Z |
Ruud Koot |
/* References */ Jean -> Jan
|
76840539 |
2006-09-20T19:30:57Z |
Wvbailey |
/* References */ Add van Leeuwen, editor. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity
|
75138927 |
2006-09-11T18:57:27Z |
Readams |
revert ungrammatical edit
|
74744864 |
2006-09-09T17:27:33Z |
Abatasigh |
/* Intractability */ sp
|
74743514 |
2006-09-09T17:19:20Z |
Abatasigh |
/* Intractability */
|
69957831 |
2006-08-16T05:25:06Z |
Bkell |
rv bold italics
|
69951886 |
2006-08-16T04:34:48Z |
203.187.133.175 |
/* The P<nowiki> = NP question */</nowiki>
|
65498040 |
2006-07-24T05:16:42Z |
Pascal.Tesson |
/* Open Questions */ bulleting list
|
65480619 |
2006-07-24T02:59:09Z |
4.250.132.143 |
copyedit
|
65411096 |
2006-07-23T18:34:37Z |
24.55.70.103 |
/* Notable researchers */ Alphebetize
|
64726503 |
2006-07-19T20:38:04Z |
GrEp |
/* Intractability */
|
62193582 |
2006-07-05T15:11:19Z |
Barcex |
/* Overview */
|
60769353 |
2006-06-27T02:43:56Z |
Pascal.Tesson |
/* Notable researchers */ removed vanity edit
|
60713723 |
2006-06-26T20:04:24Z |
Jleedev |
/* Overview */
|
54965781 |
2006-05-24T22:24:26Z |
Powo |
linked to computation
|
54965534 |
2006-05-24T22:22:59Z |
Powo |
Added link to CS portal
|
54964951 |
2006-05-24T22:19:13Z |
Powo |
/* Notable researchers */ Added Jack Lutz
|
54747318 |
2006-05-23T18:08:16Z |
Bkell |
/* Intractability */ can't -> cannot
|
53527791 |
2006-05-16T16:25:47Z |
193.205.5.2 |
/* Notable researchers */
|
53504255 |
2006-05-16T13:39:32Z |
196.44.242.12 |
/* Notable researchers */
|
52815118 |
2006-05-12T10:40:16Z |
24.68.243.82 |
|
52387894 |
2006-05-09T22:27:05Z |
Clecio~enwiki |
bot pt
|
50430384 |
2006-04-27T15:00:14Z |
Klutzy |
robot Adding: ar, it, ko Modifying: fr
|
48883977 |
2006-04-17T19:54:15Z |
203.200.95.130 |
/* See also */
|
48883770 |
2006-04-17T19:52:47Z |
203.200.95.130 |
/* See also */
|
48883693 |
2006-04-17T19:52:03Z |
203.200.95.130 |
/* See also */
|
48883551 |
2006-04-17T19:50:53Z |
203.200.95.130 |
/* See also */
|
48883438 |
2006-04-17T19:49:59Z |
203.200.95.130 |
/* See also */
|
48601890 |
2006-04-15T19:27:26Z |
88.154.96.91 |
/* Notable researchers */
|
48531888 |
2006-04-15T06:01:20Z |
Creidieki |
add link to [[computational resource]]
|
47366988 |
2006-04-07T05:56:09Z |
Ripper234 |
Merge notice removed
|
46965661 |
2006-04-04T19:01:58Z |
Creidieki |
decrease spacing on merge tags at beginning of article
|
46818899 |
2006-04-03T22:08:16Z |
Creidieki |
/* Complexity classes */ add section on computational resources
|
46776455 |
2006-04-03T17:18:42Z |
Creidieki |
/* The P<nowiki> = NP question */ wk "complete (complexity)"</nowiki>
|
46768538 |
2006-04-03T16:20:54Z |
Ruud Koot |
mergedisputed
|
46764315 |
2006-04-03T15:48:05Z |
Ripper234 |
Sorry, but I put the merge tag back - resolve the conflict in discussion and only then remove the tag.
|
46649489 |
2006-04-02T21:54:50Z |
Creidieki |
remove mergefrom notices (see talk)
|
46640368 |
2006-04-02T20:46:53Z |
Creidieki |
wk "computational problem"
|
46514424 |
2006-04-01T22:56:38Z |
Ripper234 |
NESPACE is too specific, removed merge tag
|
46509570 |
2006-04-01T22:16:47Z |
Ripper234 |
Sorry, NESPACE not NETIME (too many of these)
|
46509437 |
2006-04-01T22:15:45Z |
Ripper234 |
more mergefroms.. (NETIME)
|
46505489 |
2006-04-01T21:43:48Z |
Ripper234 |
Arg, fix template again
|
46505433 |
2006-04-01T21:43:20Z |
Ripper234 |
fixed template
|
46505353 |
2006-04-01T21:42:45Z |
Ripper234 |
Mergefrom DSPACE & DTIME
|
46373002 |
2006-03-31T21:50:10Z |
129.186.205.85 |
/* External links */
|
45493748 |
2006-03-26T00:51:29Z |
Ixfd64 |
Unicode
|
44030229 |
2006-03-16T09:50:20Z |
Postrach |
interwiki +cs:
|
43757117 |
2006-03-14T17:54:39Z |
81.222.223.34 |
Lithuanian link corrected
|
43611725 |
2006-03-13T19:29:49Z |
80.178.109.192 |
|
43367007 |
2006-03-12T01:02:08Z |
Ruud Koot |
Reverted edits by [[Special:Contributions/207.134.161.226|207.134.161.226]] ([[User talk:207.134.161.226|talk]]) to last version by Mikkalai
|
43365502 |
2006-03-12T00:49:38Z |
207.134.161.226 |
/* Notable researchers */
|
43320588 |
2006-03-11T18:56:09Z |
Altenmann |
amusing, and right on topic: complexity theory.
|
43318768 |
2006-03-11T18:40:59Z |
Readams |
exceedingly amusing, but, unfortunately, out of place
|
43026079 |
2006-03-09T21:15:38Z |
Altenmann |
/* Notable researchers */ notable is notable is notable, you want him here, article please, as in all wikipedia lists: [[wikipedia:Verifiability]] issue
|
43025517 |
2006-03-09T21:11:59Z |
Altenmann |
/* See also */
|
42956955 |
2006-03-09T11:56:28Z |
217.34.40.71 |
/* Overview */
|
42956926 |
2006-03-09T11:56:10Z |
217.34.40.71 |
/* Overview */
|
42460684 |
2006-03-06T10:30:14Z |
Bo Jacoby |
/* Complexity classes */ link to polynomial time
|
41927488 |
2006-03-02T17:59:27Z |
Readams |
no, it won't be possible. 2^100 is and always will be intractable. Sorry.
|
39719264 |
2006-02-15T10:25:47Z |
Henrygb |
/* Intractability */
|
39537673 |
2006-02-14T03:55:27Z |
Ben Standeven |
/* Decision problems */ simplify statement of time hierarchy
|
38931894 |
2006-02-09T16:31:05Z |
Trovatore |
/* See also */ [[game complexity]] is reasonable; the other three are too tangential
|
38920513 |
2006-02-09T14:47:32Z |
70.111.251.203 |
/* See also */
|
38920152 |
2006-02-09T14:44:26Z |
70.111.251.203 |
/* See also */
|
37719033 |
2006-02-01T19:49:24Z |
212.156.179.162 |
|
37564549 |
2006-01-31T20:28:44Z |
Mikeblas |
disambiguation link repair ([[Wikipedia:Disambiguation pages with links|You can help!]])
|
36877135 |
2006-01-27T01:21:45Z |
130.94.162.61 |
added a little more to intro -- somebody explain it better please.
|
34397450 |
2006-01-08T19:55:51Z |
Ruud Koot |
rvv
|
34217757 |
2006-01-07T07:24:09Z |
69.9.146.43 |
|
32977881 |
2005-12-28T08:53:58Z |
Auminski |
/* Complexity classes */ Updated with links
|
32784489 |
2005-12-26T18:38:15Z |
Hmonroe |
/* Overview */
|
31145647 |
2005-12-13T03:41:04Z |
Contrasedative |
/* Complexity classes */
|
31047925 |
2005-12-12T13:55:38Z |
Bsotomay |
researchers (Borja Sotomayor is not a notable researcher... this seems like a practical joke or a confusion)
|
30170903 |
2005-12-05T01:02:09Z |
213.112.23.54 |
updated link
|
29539850 |
2005-11-29T00:41:03Z |
Readams |
|
29539304 |
2005-11-29T00:35:13Z |
Readams |
|
29539267 |
2005-11-29T00:34:43Z |
Readams |
|
29226111 |
2005-11-25T18:35:42Z |
Ruud Koot |
|
29225984 |
2005-11-25T18:33:41Z |
Ruud Koot |
|
29225737 |
2005-11-25T18:30:08Z |
Ruud Koot |
|
28547593 |
2005-11-17T00:24:09Z |
Ruud Koot |
cat
|
27667325 |
2005-11-08T00:07:24Z |
Cesarsorm~enwiki |
/* Notable researchers */
|
26508601 |
2005-10-26T06:30:58Z |
SpaceMoose |
/* Notable researchers */ spelling
|
26448589 |
2005-10-25T15:28:00Z |
Chalst |
/* External links */
|
26448542 |
2005-10-25T15:27:10Z |
Chalst |
/* External links */
|
26432615 |
2005-10-25T10:31:19Z |
131.220.4.177 |
add "Marek Karpinski"
|
24566284 |
2005-10-02T15:15:41Z |
MathMartin |
/* Notable researchers */ added short reason for importance
|
24556394 |
2005-10-02T12:35:22Z |
MathMartin |
/* Notable researchers */ added [[Allan Borodin]]
|
24556120 |
2005-10-02T12:30:06Z |
MathMartin |
/* External links */ added link
|
24038147 |
2005-09-26T00:28:29Z |
70.110.185.225 |
|
23979512 |
2005-09-25T08:30:34Z |
61.109.229.6 |
/* Complexity classes */
|
23058149 |
2005-09-11T20:41:21Z |
Creidieki |
/* The P<nowiki> = NP question */ bolded explicit crossreferences</nowiki>
|
22687902 |
2005-09-06T09:58:02Z |
202.63.168.35 |
|
22687862 |
2005-09-06T09:56:50Z |
202.63.168.35 |
/* Overview */
|
21859675 |
2005-08-26T04:54:02Z |
207.189.187.227 |
/* External links */
|
21487845 |
2005-08-21T08:55:32Z |
Flammifer |
/* See also */ +complexity
|
21023819 |
2005-08-14T22:31:53Z |
Orz |
/* Overview */ fixed a grammatical error
|
20651010 |
2005-08-09T22:33:58Z |
PrologFan |
Add section on intractability
|
20332542 |
2005-08-05T12:33:08Z |
Knutux |
fixed lt:
|
19628886 |
2005-07-26T07:49:46Z |
Zipcube |
rv due to vandalism
|
19627671 |
2005-07-26T07:12:50Z |
211.31.172.164 |
|
19225811 |
2005-07-20T13:31:00Z |
Creidieki |
/* Complexity classes */ fixed references to P to point to the "P (complexity)" article
|
19212578 |
2005-07-20T08:11:38Z |
Tea2min |
rv vandalism
|
19209795 |
2005-07-20T06:55:21Z |
69.111.117.169 |
/* Decision problems */
|
18610001 |
2005-07-11T17:04:57Z |
138.238.148.16 |
|
18536894 |
2005-07-10T16:35:19Z |
Fredrik |
/* Overview */
|
18536743 |
2005-07-10T16:32:06Z |
Fredrik |
|
18536693 |
2005-07-10T16:31:04Z |
Fredrik |
|
18361978 |
2005-07-07T23:39:33Z |
80.58.3.170 |
/* Complexity classes */
|
17861577 |
2005-06-29T23:42:21Z |
Tejas81 |
/* Notable researchers */
|
17739179 |
2005-06-28T06:12:10Z |
63.231.142.12 |
/* Notable researchers */
|
15905606 |
2005-06-03T23:00:59Z |
Michael Hardy |
/* The P<nowiki>=NP question */</nowiki>
|
14663027 |
2005-06-03T08:29:52Z |
Bluemoose |
'Algoritm' -> 'algorithm'; -- [[User:Humanbot|Join and fix more!]]
|
14629836 |
2005-05-23T18:46:12Z |
Dcoetzee |
Link complement
|
14121808 |
2005-05-20T13:36:46Z |
61.95.133.170 |
/* Notable researchers */
|
13973357 |
2005-05-19T11:34:47Z |
61.95.133.170 |
/* Notable researchers */
|
13924353 |
2005-05-14T00:29:20Z |
Altenmann |
Reverted edits by [[Special:Contributions/134.225.173.247|134.225.173.247]] to last version by RexNL
|
13675544 |
2005-05-14T00:10:55Z |
134.225.173.247 |
/* Complexity classes */
|
13674976 |
2005-05-12T22:25:58Z |
RexNL |
+nl:
|
13629154 |
2005-05-09T10:33:57Z |
Knutux |
+lt
|
13469989 |
2005-05-07T02:42:30Z |
Mathbot |
"Made section headings conform to the [[Wikipedia:Manual of Style#Headings]]. This is a semi-automatic update"
|
13366974 |
2005-05-05T02:48:17Z |
131.215.220.112 |
/* Notable researchers */ Tweaked the list to better represent a consensus view
|
13248234 |
2005-04-30T06:07:04Z |
FlaBot |
warnfile Modifying:ja
|
13012606 |
2005-04-28T06:12:15Z |
RainR |
rv vandal
|
12919069 |
2005-04-28T06:11:43Z |
203.200.95.130 |
/* The P<nowiki>=NP question */</nowiki>
|
12919054 |
2005-04-28T06:10:30Z |
203.200.95.130 |
/* The P<nowiki>=NP question */</nowiki>
|
12919019 |
2005-04-26T23:01:21Z |
Stevertigo |
|
12857820 |
2005-04-23T18:59:03Z |
82.210.146.45 |
|
12717687 |
2005-04-23T16:36:59Z |
68.78.98.112 |
spelling error
|
12712855 |
2005-04-20T17:43:57Z |
Altenmann |
Reverted edits by [[Special:Contributions/66.81.27.165|66.81.27.165]] to last version by Rend
|
12572761 |
2005-04-20T10:57:48Z |
66.81.27.165 |
/* Complexity classes */
|
12561800 |
2005-04-14T01:21:25Z |
Rend~enwiki |
/* added link to 'space hierarchy theorem' */
|
12279782 |
2005-03-24T14:41:38Z |
84.94.112.240 |
+he
|
11469919 |
2005-03-15T21:23:41Z |
69.138.233.185 |
/* Notable researchers */
|
11176354 |
2005-03-12T07:59:56Z |
158.108.251.58 |
+th
|
11051834 |
2005-02-21T18:43:39Z |
203.200.95.130 |
/* Notable researchers */
|
10499792 |
2005-02-09T11:42:29Z |
Tdgs |
Typo Edit, Michel --> Michael
|
10096267 |
2005-02-07T00:48:47Z |
Bruno Unna |
/* Complexity classes */
|
10015953 |
2005-01-26T17:04:08Z |
203.199.209.81 |
/* Notable researchers */
|
9676096 |
2005-01-07T06:20:41Z |
Robert Merkel |
remove Y.L. Chin - biographical article doesn't explain why he deserves to be on this list...
|
9169091 |
2005-01-07T05:09:49Z |
202.6.94.40 |
/* Notable researchers */
|
9167792 |
2005-01-04T01:25:31Z |
80.98.120.104 |
/* Decision problems */
|
9087847 |
2004-12-30T23:41:35Z |
Xiaoyang |
/* Notable researchers */
|
8961904 |
2004-12-30T23:36:22Z |
Xiaoyang |
/* Notable researchers */
|
8961733 |
2004-11-26T15:01:49Z |
Dcoetzee |
Move link from see also up
|
7873978 |
2004-11-26T15:00:29Z |
Dcoetzee |
/* See also */ +Descriptive complexity
|
7873951 |
2004-11-14T15:18:09Z |
MathMartin |
link
|
7453209 |
2004-11-10T01:50:00Z |
Creidieki |
/* Notable researchers */ Added [[Manuel Blum]] (Turing award for computational complexity theory)
|
7281556 |
2004-11-06T17:24:31Z |
MathMartin |
-[[Category:Recurstion theory]]
|
7162931 |
2004-10-28T17:39:20Z |
203.169.200.15 |
+zh
|
6934868 |
2004-10-25T07:44:44Z |
APH |
/* See also */ Open problems
|
6847399 |
2004-10-13T08:29:59Z |
Chalst |
-cat comp. terminology; +2cats
|
6543829 |
2004-10-10T16:12:45Z |
203.199.209.81 |
/* Notable researchers */
|
6471608 |
2004-09-28T05:43:19Z |
12.221.231.200 |
|
6206676 |
2004-09-19T07:04:37Z |
Guanabot |
Guanaco - robot: converting HTML tags to proper wiki markup and removing excess newlines
|
5984467 |
2004-09-09T03:59:24Z |
Ascánder |
--> es:
|
5755301 |
2004-09-02T08:38:34Z |
N12345n |
|
5603582 |
2004-09-02T08:37:56Z |
N12345n |
Link to Complexit Zoo addedd
|
5603576 |
2004-08-21T14:17:01Z |
Leibniz |
/* See also */
|
5347739 |
2004-08-09T15:28:51Z |
Robert Merkel |
/* Overview */ linkify
|
5099777 |
2004-07-30T07:22:12Z |
Mav |
removed self-ref
|
4914925 |
2004-07-25T23:34:06Z |
David Gerard |
[[Category:Wikipedia Featured Articles]]
|
4844531 |
2004-07-21T13:42:23Z |
Aphaia |
+el
|
4764697 |
2004-07-12T22:35:27Z |
Wernher |
[[Category:Computer terminology]]
|
4591449 |
2004-06-23T11:16:09Z |
Fredrik |
Foo Bar Baz ---> Foo bar baz (see Manual of Style on capitalization)
|
4237747 |
2004-06-03T23:13:00Z |
Template namespace initialisation script |
|
3878345 |
2004-05-18T17:04:02Z |
Gdr |
=Complexity classes= fix link
|
3632503 |
2004-05-18T16:57:31Z |
Gdr |
=Complexity classes= fix link
|
3632441 |
2004-05-18T14:44:00Z |
Gdr |
Move list to complexity class article, give intro
|
3631362 |
2004-05-18T12:42:33Z |
Gdr |
=See also=
|
3630624 |
2004-05-17T10:20:14Z |
Gdr |
Avoid redirect to NC
|
3615901 |
2004-05-16T20:47:14Z |
Andris |
unlink randomized algorithms in PP, linked in an earlier item
|
3608096 |
2004-05-16T20:46:27Z |
Andris |
=Famous complexity classes= added PP
|
3608077 |
2004-05-16T15:38:49Z |
Gdr |
=Notable Researchers= add Savitch, Razborov
|
3604447 |
2004-04-29T11:59:04Z |
APH |
|
3381542 |
2004-04-19T05:18:43Z |
Ehsan~enwiki |
|
3248407 |
2004-04-09T06:21:44Z |
GulDan |
Added link to all other Complexity Class Pages {{msg:ComplexityClasses}}
|
3119047 |
2004-04-09T06:20:24Z |
GulDan |
=Famous complexity classes= Removed link to the letter P and replaced it with link to complexity class
|
3119039 |
2004-04-06T18:46:13Z |
Michael Hardy |
|
3085828 |
2004-04-06T18:42:40Z |
Michael Hardy |
=Famous complexity classes=
|
3085783 |
2004-04-06T18:42:15Z |
Michael Hardy |
=The P<nowiki>=
|
3085778 |
2004-03-13T06:19:10Z |
Arvindn |
'much' is correct: resource is uncountable in this context
|
2744091 |
2004-03-13T02:39:57Z |
210.11.213.3 |
much more -> many more
|
2742291 |
2004-03-04T05:46:12Z |
Arvindn |
gr
|
2622147 |
2004-03-03T19:47:33Z |
Timwi |
more info on time complexity and the time hierarchy theorem
|
2615306 |
2004-01-15T23:05:31Z |
24.106.61.205 |
Minor Edit
|
2162044 |
2004-01-05T08:29:59Z |
APH |
|
2089211 |
2003-12-21T15:14:11Z |
Arvindn |
|
2014437 |
2003-12-21T15:06:04Z |
Arvindn |
|
2014392 |
2003-12-19T22:17:20Z |
Prumpf |
escape = in P=NP header
|
2001911 |
2003-12-18T21:38:02Z |
Populus |
remove = from P=NP header to make it format right
|
1993689 |
2003-12-17T21:10:44Z |
Pakaran |
note that some languages are in both, or neither, NP and Co-NP
|
1984897 |
2003-12-17T21:04:40Z |
Charles Matthews |
fmt
|
1984857 |
2003-12-09T17:57:56Z |
E23~enwiki |
+sv:
|
1915567 |
2003-12-07T19:01:12Z |
The Anome |
[[randomized algorithm]]s
|
1896675 |
2003-11-02T04:25:06Z |
219.65.196.183 |
|
1661603 |
2003-11-01T20:04:11Z |
GulDan |
Added listing for PCP
|
1659580 |
2003-10-21T16:26:04Z |
Jimbreed |
disamb NP
|
1602067 |
2003-10-17T10:47:25Z |
Docu |
disamb. NP
|
1579265 |
2003-09-06T11:19:21Z |
Docu |
disamb.
|
1399493 |
2003-08-27T13:35:02Z |
Robert Merkel |
add some notable researchers in the area
|
1352728 |
2003-08-09T01:45:13Z |
GulDan |
Removed the example from the bottom and integrated it with the introduction. Removed duplicate statements of information from the bottom as well.
|
1262389 |
2003-08-08T20:06:44Z |
Nixdorf |
and another link to big O notation...
|
1261239 |
2003-08-08T19:58:07Z |
Nixdorf |
link
|
1261187 |
2003-07-31T18:06:24Z |
GulDan |
Removing Co-UP and adding a note that many classes have a CO partner and if it isn't listed, they should just look at the other one.
|
1222412 |
2003-07-31T17:58:30Z |
GulDan |
Added UP and Co-UP to the list
|
1222381 |
2003-07-13T19:12:27Z |
Looxix~enwiki |
interlanguage links
|
1145349 |
2003-07-10T19:13:42Z |
130.123.128.24 |
Minor grammo fixup -- "mow the double area" -> "mow double the area"
|
1134465 |
2003-06-30T11:00:30Z |
219.98.151.29 |
+ja
|
1095942 |
2003-06-26T22:12:37Z |
Ryguasu |
extremely half-assed merge of material from "Complexity"
|
1084100 |
2003-06-23T17:41:19Z |
Timwi |
"nondeterministic" => "non-deterministic"
|
1073686 |
2003-06-21T23:05:21Z |
Youandme |
+pl:
|
1067842 |
2003-02-14T14:36:06Z |
149.157.247.148 |
|
668446 |
2003-02-14T14:35:40Z |
149.157.247.148 |
|
668445 |
2003-02-06T04:25:10Z |
AxelBoldt |
|
645773 |
2003-02-05T02:15:49Z |
204.1.140.2 |
|
642929 |
2003-02-05T02:15:01Z |
204.1.140.2 |
|
642926 |
2003-01-18T15:35:18Z |
Chinju |
|
596785 |
2002-12-13T14:58:41Z |
217.5.141.103 |
de:
|
489462 |
2002-09-23T10:21:08Z |
Hfastedge |
|
307452 |
2002-09-16T16:54:27Z |
LC~enwiki |
fix broken link
|
245659 |
2002-01-09T11:26:47Z |
LC~enwiki |
+[[Integer factorization]]
|
245658 |
2002-01-09T09:33:50Z |
LC~enwiki |
*
|
245657 |
2002-01-08T22:54:09Z |
LC~enwiki |
|
245656 |
2001-12-22T18:57:22Z |
64.105.27.xxx |
*
|
245655 |
2001-12-22T18:48:58Z |
64.105.27.xxx |
Moving [[Complexity theory in computation]] to [[Computational complexity theory]]
|
245079 |
2001-12-14T07:30:21Z |
AxelBoldt |
reverting: NP is defined in the previous paragraph already
|
245078 |
2001-12-14T05:47:13Z |
24.93.53.xxx |
*
|
245077 |
2001-12-09T16:06:55Z |
AxelBoldt |
Reverting. Little Guru, stop your idiotic edits.
|
245076 |
2001-12-09T16:05:05Z |
Little_guru |
added [[data mining]] to definition
|
245075 |
2001-12-06T22:55:29Z |
137.112.129.xxx |
example of a complement
|
245074 |
2001-12-05T23:21:36Z |
62.202.117.xxx |
*
|
245072 |
2001-12-05T23:12:20Z |
62.202.117.xxx |
moved
|
222393 |
2002-09-16T16:45:37Z |
202.141.80.19 |
|
222385 |
2002-09-16T01:24:31Z |
136.145.151.28 |
|
221041 |
2002-09-16T01:23:57Z |
136.145.151.28 |
|
221040 |
2002-06-02T13:50:52Z |
LC~enwiki |
*
|
84394 |
2002-06-02T12:11:19Z |
LC~enwiki |
*
|
84357 |
2002-06-02T12:10:42Z |
LC~enwiki |
*
|
84356 |
2002-06-02T11:44:39Z |
LC~enwiki |
*
|
84340 |
2002-03-06T20:54:30Z |
131.215.44.20 |
*
|
24633 |
2002-02-25T15:51:15Z |
LC~enwiki |
*
|
13024 |
2002-02-17T20:08:28Z |
LC~enwiki |
*
|
7476 |
2002-02-09T03:02:13Z |
Conversion script |
Automated conversion
|