The Electronic Colloquium on Computational Complexity (ECCC) is an electronic archive of research papers in computational complexity theory, a branch of...
3 KB (416 words) - 07:50, 21 July 2025
2011). "On Sunflowers and Matrix Multiplication". Electronic Colloquium on Computational Complexity. TR11-067. Raz, Ran (2002). "On the complexity of matrix...
35 KB (4,295 words) - 07:42, 21 July 2025
necessarily undergo any refereeing process. arXiv Electronic Colloquium on Computational Complexity Official website "About the Cryptology ePrint Archive"...
1 KB (67 words) - 22:37, 27 May 2024
textbook on the subject, commonly known as the "Blue Book". Also available for download (PDF) at the Electronic Colloquium on Computational Complexity.) Zwick...
21 KB (2,571 words) - 00:57, 18 May 2025
measurements and the Abelian Stabilizer Problem (Report). Electronic Colloquium on Computational Complexity (ECCC). Abrams, Daniel S.; Lloyd, Seth (1999-12-13)...
29 KB (3,376 words) - 07:03, 25 May 2025
Decision tree model (redirect from Decision tree complexity)
In computational complexity theory, the decision tree model is the model of computation in which an algorithm can be considered to be a decision tree,...
20 KB (3,229 words) - 03:12, 21 July 2025
most directions". Electronic Colloquium on Computational Complexity. Sherstov, Alexander A. (2012). "The Communication Complexity of Gap Hamming Distance"...
18 KB (3,160 words) - 07:55, 19 July 2025
Catalytic computing (category Complexity classes)
Catalytic Approaches to the Tree Evaluation Problem, Electronic Colloquium on Computational Complexity, TR20-056, retrieved 2025-05-21 Cook, James; Mertz...
6 KB (679 words) - 08:47, 25 June 2025
functions in polynomial time". Electronic Colloquium on Computational Complexity. ECCC TR05-008. For earlier research on this problem, see: Ma, Keju; von...
20 KB (2,752 words) - 08:07, 5 April 2025
transmitted data. Computational complexity theory is a branch of the theory of computation that focuses on classifying computational problems according...
42 KB (4,803 words) - 23:57, 1 June 2025
Hypercomputation (redirect from Super-Turing computation)
literature focuses instead on the computation of deterministic, rather than random, uncomputable functions. A computational model going beyond Turing machines...
30 KB (3,369 words) - 19:26, 13 May 2025
computations, memories, and communications are organized. The computational complexity of an algorithm can be measured given a model of computation....
43 KB (4,694 words) - 17:07, 3 July 2025
Institute for the Theory of Computing and on the scientific board of the Electronic Colloquium on Computational Complexity. O'Donnell operates a YouTube channel...
8 KB (687 words) - 00:56, 21 May 2025
computability, computational complexity, automata theory and formal languages: CCC - Computational Complexity Conference FCT – International Symposium on Fundamentals...
15 KB (1,407 words) - 17:19, 24 July 2025
in the eastern USA Electronic Colloquium on Computational Complexity, an electronic archive of computer science papers Electronic Commerce Council of...
1 KB (199 words) - 18:33, 27 October 2024
Goldberg and M. Paterson, On counting homomorphisms to directed acyclic graphs, Electronic Colloquium on Computational Complexity, Report TR05-121, Oct 2005...
6 KB (654 words) - 09:52, 15 March 2025
Approximation Algorithm for the Bandwidth Problem on Dense Graphs". Electronic Colloquium on Computational Complexity. 4 (17). Minimum bandwidth problem, in: Pierluigi...
11 KB (1,517 words) - 17:50, 2 July 2025
Propositional proof system (redirect from Propositional proof complexity)
Propositional proof complexity: past, present and future. Technical Report TR98-067, Electronic Colloquium on Computational Complexity. Nathan Segerlind...
9 KB (1,121 words) - 06:43, 5 September 2024
QMA (category Probabilistic complexity classes)
PH". Electronic Colloquium on Computational Complexity. Gharibian, Sevag; Yirka, Justin (2019). "The complexity of simulating local measurements on quantum...
14 KB (1,854 words) - 13:46, 31 July 2025
Ludwig Staiger (category Theory of computation)
Bibliography Server Handbook of Formal Languages Electronic Colloquium on Computational Complexity Reports of Ludwig Staiger L. Staiger. Quasiperiods...
5 KB (445 words) - 03:00, 18 June 2025
Steiner tree problem (category Computational problems in graph theory)
computing Steiner trees in the plane: an updated computational study". Mathematical Programming Computation. 10 (4): 487–532. doi:10.1007/s12532-018-0135-8...
36 KB (4,416 words) - 00:53, 24 July 2025
Chaos theory (category Computational fields of study)
you can execute computation with such dynamical systems, and as such the halting problem is not decidable, therefore some computational algorithms may...
119 KB (13,466 words) - 11:36, 3 August 2025
and co-founder of the online journal on complexity theory ECCC – Electronic Colloquium on Computational Complexity and its editor-in-chief until 2016....
19 KB (2,055 words) - 05:17, 4 August 2025
Logic optimization (redirect from Harvard Computation Laboratory minimizing chart)
often referred to as exact synthesis in the literature. Due to the computational complexity, exact synthesis is tractable only for small Boolean functions...
16 KB (1,657 words) - 13:37, 23 April 2025
Induced path (section Algorithms and complexity)
Piotr; Schnitger, Georg (1992). "On the complexity of approximating the independent set problem". Information and Computation. 96 (1): 77–94. doi:10...
13 KB (1,486 words) - 07:48, 18 July 2024
statistics. The main problem with direct methods is the great computational complexity associated with the estimation and inversion of matrices formed...
21 KB (2,884 words) - 21:32, 4 February 2024
Two significant events occurred in that year: the first was the Turing Colloquium, which was held at the University of Sussex in April, and brought together...
103 KB (12,615 words) - 13:05, 4 August 2025
Minimum k-cut (category Computational problems in graph theory)
(2003-04-01). "Cutting Up Is Hard To Do: The Parameterised Complexity of k-Cut and Related Problems". Electronic Notes in Theoretical Computer Science. CATS'03,...
8 KB (847 words) - 01:06, 27 January 2025
Ada Lovelace (redirect from Ada Byron's notes on the analytical engine)
BCS. Archived from the original on 26 August 2006. "BCSWomen Lovelace Colloquium". UK. Archived from the original on 22 February 2014. Retrieved 4 March...
93 KB (9,797 words) - 15:13, 6 August 2025
(and forgo Turing completeness, although still retaining high computational complexity), using more controlled corecursion wherever non-terminating behavior...
58 KB (6,372 words) - 21:54, 30 July 2025