Computability theory, also known as recursion theory, is a branch of mathematical logic, computer science, and the theory of computation that originated...
54 KB (6,414 words) - 03:45, 30 May 2025
Theory of Computing is a peer-reviewed open access scientific journal covering theoretical computer science. The journal was established in 2005 and is...
1 KB (50 words) - 12:23, 12 September 2024
The Annual ACM Symposium on Theory of Computing (STOC) is an academic conference in the field of theoretical computer science. STOC has been organized...
12 KB (1,162 words) - 05:39, 15 September 2024
In mathematics, computable measure theory is the part of computable analysis that deals with effective versions of measure theory. Jeremy Avigad (2012)...
731 bytes (85 words) - 23:07, 2 June 2017
complexity of linear optics". Proceedings of the forty-third annual ACM symposium on Theory of computing. San Jose, California: Association for Computing Machinery...
114 KB (12,489 words) - 03:55, 15 July 2025
Theoretical computer science (redirect from Computer science theory)
the number of processors (used in parallel computing). One of the roles of computational complexity theory is to determine the practical limits on what...
42 KB (4,803 words) - 23:57, 1 June 2025
Theory of Computing Systems is a peer-reviewed scientific journal published by Springer Verlag. Published since 1967 as Mathematical Systems Theory and...
2 KB (101 words) - 11:54, 10 August 2023
The Simons Institute for the Theory of Computing at the University of California, Berkeley is an institute for collaborative research in theoretical computer...
7 KB (553 words) - 20:45, 9 March 2025
{\displaystyle O(mn+n^{2}\log n)} . Computing all-pairs shortest paths is the fastest known method for computing the diameter of a weighted graph exactly. In...
9 KB (1,087 words) - 01:54, 25 June 2025
Computability is the ability to solve a problem by an effective procedure. It is a key topic of the field of computability theory within mathematical...
21 KB (3,293 words) - 20:34, 1 June 2025
FOCS and its annual Association for Computing Machinery counterpart STOC (the Symposium on Theory of Computing) are considered the two top conferences...
13 KB (534 words) - 00:13, 25 February 2025
Dana Angluin (category University of California, Berkeley alumni)
emeritus of computer science at Yale University. She is known for foundational work in computational learning theory and distributed computing. Angluin...
14 KB (1,235 words) - 07:46, 24 June 2025
Sheila Greibach (category University of California, Los Angeles faculty)
languages in computing, automata, compiler theory and computer science. She is an Emeritus Professor of Computer Science at the University of California...
11 KB (1,353 words) - 00:43, 18 March 2025
on Foundations of Computer Science (FOCS 2016)". SIAM Journal on Computing. 48 (2): 451. doi:10.1137/19N974762. SIAM Journal on Computing bibliographic...
2 KB (154 words) - 17:03, 2 May 2024
"Generating hard instances of lattice problems". Proceedings of the Twenty-Eighth annual ACM symposium on Theory of computing. Philadelphia, Pennsylvania...
28 KB (3,660 words) - 18:18, 23 June 2025
and selected bibliography. In Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing (May 1992), pages 351–369. http://portal.acm...
8 KB (865 words) - 00:46, 24 March 2025
Computable functions are the basic objects of study in computability theory. Informally, a function is computable if there is an algorithm that computes...
24 KB (3,362 words) - 23:24, 22 May 2025
Boolean satisfiability problem (redirect from Satisfiability of boolean expressions)
(1978). "The complexity of satisfiability problems" (PDF). Proceedings of the 10th Annual ACM Symposium on Theory of Computing. San Diego, California....
45 KB (4,870 words) - 16:46, 24 June 2025
(even years) and STOC (odd years). STOC is the ACM Symposium on Theory of Computing, one of the main North American conferences in theoretical computer science...
31 KB (2,200 words) - 21:16, 23 June 2025
Jim Simons (category Massachusetts Institute of Technology School of Science alumni)
$60 million to Berkeley to establish the Simons Institute for the Theory of Computing, the world's leading institute for collaborative research in theoretical...
64 KB (5,077 words) - 19:06, 16 June 2025
Algorithmic game theory (AGT) is an interdisciplinary field at the intersection of game theory and computer science, focused on understanding and designing...
14 KB (1,514 words) - 07:32, 11 May 2025
Catalytic computing is a technique in computer science, relevant to complexity theory, that uses full memory, as well as empty memory space, to perform...
6 KB (679 words) - 08:47, 25 June 2025
"Generating Hard Instances of Lattice Problems". Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing. pp. 99–108. CiteSeerX 10...
24 KB (2,872 words) - 22:30, 4 July 2025
Computer science (redirect from Computing science)
School of Informatics, University of Edinburgh). "In the U.S., however, informatics is linked with applied computing, or computing in the context of another...
73 KB (6,717 words) - 14:38, 7 July 2025
Verifiable computing (or verified computation or verified computing) enables a computer to offload the computation of some function, to other perhaps untrusted...
14 KB (1,887 words) - 03:39, 2 January 2024
is the ACM Computing Classification System devised by the Association for Computing Machinery. Computer science can be described as all of the following:...
11 KB (1,036 words) - 19:01, 2 June 2025
Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96. Philadelphia, Pennsylvania, USA: Association for Computing Machinery...
31 KB (4,691 words) - 06:19, 7 July 2025
Game theory is the study of mathematical models of strategic interactions. It has applications in many fields of social science, and is used extensively...
138 KB (15,372 words) - 18:05, 15 July 2025
NP-complete". Proceedings of the thiry-fourth annual ACM symposium on Theory of computing. STOC '02. New York, NY, USA: Association for Computing Machinery. pp. 761–766...
29 KB (2,746 words) - 00:31, 24 April 2025
Quantum algorithm (category Quantum computing)
speedup by quantum walk". Proceedings of the 35th Symposium on Theory of Computing. Association for Computing Machinery. pp. 59–68. arXiv:quant-ph/0209131...
39 KB (4,560 words) - 20:45, 19 June 2025