Compilation complexity: Revision history

Filter revisionsshowhide

To date:

Tag filter:

Invert selection

External tools:

For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

curprev 09:2909:29, 17 March 2025 EmausBot talk contribs m 31 bytes −4 Bot: Fixing double redirect from Summability criterion to Batch summability undo Tag: Redirect target changed

curprev 07:3707:37, 10 July 2024 EmausBot talk contribs m 35 bytes +1 Bot: Fixing double redirect to Summability criterion undo Tag: Redirect target changed

curprev 21:0021:00, 11 April 2024 Citation bot talk contribs 12,272 bytes +77 Alter: title, url, template type. URLs might have been anonymized. Add: chapter-url, chapter, authors 1-1. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Abductive | Category:Articles to be merged from March 2024 | #UCB_Category 363/430 undo

curprev 16:5916:59, 21 March 2024 Jannikp97 talk contribs 12,195 bytes +107 Suggested merge from Compilation Complexity undo

curprev 03:4403:44, 25 December 2023 OAbot talk contribs m 12,088 bytes +34 Open access bot: doi updated in citation with #oabot. undo

curprev 10:3210:32, 10 September 2023 Erel Segal talk contribs 1,564 bytes +1,564 ←Created page with ''''Compilation complexity''' is the smallest number of bits required to summarize a input to a function, such that the output of the function can be computed correctly. The notion was particulatly studied in voting theory.<ref>https://dl.acm.org/doi/abs/10.5555/1661445.1661462</ref> Often, a group has to accept a decision, but some of the voters have not arrived yet. It is desired to take the votes of the present voters and summarize them such that, whe...' Tag: Visual edit