AI & ChatGPT searches , social queries for THEORY OF-COMPUTING
Search references for THEORY OF-COMPUTING. Phrases containing THEORY OF-COMPUTING
See searches and references containing THEORY OF-COMPUTING!
Search references for THEORY OF-COMPUTING. Phrases containing THEORY OF-COMPUTING
See searches and references containing THEORY OF-COMPUTING!THEORY OF-COMPUTING
Study of computable functions and Turing degrees
Computability theory, also known as recursion theory, is a branch of mathematical logic, computer science, and the theory of computation that originated
Computability_theory
Conference in theoretical computer science
The Annual ACM Symposium on Theory of Computing (STOC) is an academic conference in the field of theoretical computer science. STOC has been organized
Symposium on Theory of Computing
Symposium_on_Theory_of_Computing
Academic journal
Theory of Computing is a peer-reviewed open access scientific journal covering theoretical computer science. The journal was established in 2005 and is
Theory_of_Computing
Research institute in Berkeley, California
The Simons Institute for the Theory of Computing at the University of California, Berkeley is an institute for collaborative research in theoretical computer
Simons Institute for the Theory of Computing
Simons_Institute_for_the_Theory_of_Computing
Subfield of computer science and mathematics
the number of processors (used in parallel computing). One of the roles of computational complexity theory is to determine the practical limits on what
Theoretical_computer_science
Academic journal
Theory of Computing Systems is a peer-reviewed scientific journal published by Springer Verlag. Published since 1967 as Mathematical Systems Theory and
Theory_of_Computing_Systems
Verifiable computing (or verified computation or verified computing) enables a computer to offload the computation of some function, to other perhaps untrusted
Verifiable_computing
Computer hardware technology that uses quantum mechanics
complexity of linear optics". Proceedings of the forty-third annual ACM symposium on Theory of computing. San Jose, California: Association for Computing Machinery
Quantum_computing
IEEE conference for theoretical computer science
FOCS and its annual Association for Computing Machinery counterpart STOC (the Symposium on Theory of Computing) are considered the two top conferences
Symposium on Foundations of Computer Science
Symposium_on_Foundations_of_Computer_Science
Longest distance between two vertices
{\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
Diameter_(graph_theory)
Theory of machine learning
and selected bibliography. In Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing (May 1992), pages 351–369. http://portal.acm
Computational_learning_theory
Dutch computer scientist
Computation (ILLC) of the University of Amsterdam (UvA). His research interests are on Quantum computing, Quantum information, Coding theory, and Computational
Ronald_de_Wolf
Optimization problem in computer science
"Generating hard instances of lattice problems". Proceedings of the Twenty-Eighth annual ACM symposium on Theory of computing. Philadelphia, Pennsylvania
Lattice_problem
Ability to solve a problem by an effective procedure
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
Computability
Academic journal
on Foundations of Computer Science (FOCS 2016)". SIAM Journal on Computing. 48 (2): 451. doi:10.1137/19N974762. SIAM Journal on Computing bibliographic
SIAM_Journal_on_Computing
Concept in software engineering and computer science
Ubiquitous computing (or "ubicomp") is a concept in software engineering, hardware engineering and computer science where computing is made to appear seamlessly
Ubiquitous_computing
Cryptographic primitives that involve lattices
"Generating Hard Instances of Lattice Problems". Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing. pp. 99–108. CiteSeerX 10
Lattice-based_cryptography
German mathematical physicist
University of Bristol, England. He is, as of Spring 2024, a visiting scientist and program organizer at the Simons Institute for the Theory of Computing at the
Nikolas_Breuckmann
Set with algorithmic membership test
In computability theory, a set of natural numbers is computable (or decidable or recursive) if there is an algorithm that computes the membership of every
Computable_set
Mathematical function that can be computed by a program
Computable functions are the basic objects of study in computability theory. Informally, a function is computable if there is an algorithm that computes
Computable_function
Technique
Catalytic computing is a technique in computer science, relevant to complexity theory, that uses full memory, as well as empty memory space, to perform
Catalytic_computing
Study of computation
School of Informatics, University of Edinburgh). "In the U.S., however, informatics is linked with applied computing, or computing in the context of another
Computer_science
Computation complexity problem
complexity". Proceedings of the thirty-sixth annual ACM symposium on Theory of computing. STOC '04. Chicago, IL, USA: Association for Computing Machinery. pp. 128–137
Hidden_matching_problem
Computer science award
(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
Gödel_Prize
In computability theory, the assignment of natural numbers to a set of objects
In computability theory a numbering is an assignment of natural numbers to a set of objects such as functions, rational numbers, graphs, or words in some
Numbering (computability theory)
Numbering_(computability_theory)
Area of discrete mathematics
intersection graph of segments in the plane: Extended abstract". Proceedings of the forty-first annual ACM symposium on Theory of computing. pp. 631–638. doi:10
Graph_theory
Quantum search algorithm
Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96. Philadelphia, Pennsylvania, USA: Association for Computing Machinery
Grover's_algorithm
Israeli American computer scientist (born 1959)
Weizmann Institute of Science, the former director of the Simons Institute for the Theory of Computing, and co-founder and chief scientist of Duality Technologies
Shafi_Goldwasser
Study of algorithms in strategic environments
Algorithmic game theory (AGT) is an interdisciplinary field at the intersection of game theory and computer science, focused on understanding and designing
Algorithmic_game_theory
American computer scientist (born 1969)
has been a member of the program committee for the Symposium on Theory of Computing in 2011 and various other conferences. He won the Ron V. Book best
Ryan Williams (computer scientist)
Ryan_Williams_(computer_scientist)
Israeli computer scientist
of the 21st ACM Symposium on Theory of Computing (STOC), Seattle, Washington, USA, May 1989, pages 73-85 2015: Michael Ben-Or, "Another Advantage of Free
Michael_Ben-Or
Quantum algorithm
Complexity: Collision and Element Distinctness with Small Range" (PDF). Theory of Computing. 1 (1): 37–46. doi:10.4086/toc.2005.v001a003. Kutin, S. (2005). "Quantum
BHT_algorithm
Mathematical models of strategic interactions
Game theory is the study of mathematical models of strategic interactions. It has applications in many fields of social science, and is used extensively
Game_theory
In computability theory, a maximal set is a coinfinite computably enumerable subset A of the natural numbers such that for every further computably enumerable
Maximal set (computability theory)
Maximal_set_(computability_theory)
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
List_of_NP-complete_problems
Algorithmic technique using hashing
Neighbors: Towards Removing the Curse of Dimensionality.". Proceedings of 30th Symposium on Theory of Computing. Charikar, Moses S. (2002). "Similarity
Locality-sensitive_hashing
Range". Theory of Computing. 1 (1): 29–36. doi:10.4086/toc.2005.v001a002. Misra, J.; Gries, D. (1982), "Finding repeated elements", Science of Computer
Element_distinctness_problem
Problem of determining if a Boolean formula could be made true
(1978). "The complexity of satisfiability problems" (PDF). Proceedings of the 10th Annual ACM Symposium on Theory of Computing. San Diego, California.
Boolean satisfiability problem
Boolean_satisfiability_problem
mathematics, computable measure theory is the part of computable analysis that deals with effective versions of measure theory. As with measure theory, this
Computable_measure_theory
Algorithm to be run on quantum computers
speedup by quantum walk". Proceedings of the 35th Symposium on Theory of Computing. Association for Computing Machinery. pp. 59–68. arXiv:quant-ph/0209131
Quantum_algorithm
Canadian computer scientist
"Efficient quantum tomography II". Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. ACM. pp. 962–974. doi:10.1145/3055399.3055454
Ryan O'Donnell (computer scientist)
Ryan_O'Donnell_(computer_scientist)
American computer scientist
Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97. El Paso, Texas, USA: Association for Computing Machinery. pp
Russell_Impagliazzo
Russian mathematician
of the twenty-first annual ACM symposium on Theory of computing - STOC '89". Proceedings of the 21st Annual ACM Symposium on the Theory of Computing.
Alexander_Razborov
Physics phenomenon
deterministic complexity of Edmonds' Problem and quantum entanglement". Proceedings of the thirty-fifth annual ACM symposium on Theory of computing. p. 10. arXiv:quant-ph/0303055
Quantum_entanglement
Theoretical computer scientist
Research Chair in quantum computing. He is an editor of the journal Theory of Computing and former editor for the journal Quantum Information & Computation
John Watrous (computer scientist)
John_Watrous_(computer_scientist)
American computer scientist (born 1981)
Chair of Computer Science at the University of Texas at Austin. His primary areas of research are computational complexity theory and quantum computing. Aaronson
Scott_Aaronson
Inherent difficulty of computational problems
of the field of computational complexity. Closely related fields in theoretical computer science are analysis of algorithms and computability theory.
Computational complexity theory
Computational_complexity_theory
Set of edges without common vertices
graphs, because computing the permanent of an arbitrary 0–1 matrix (another #P-complete problem) is the same as computing the number of perfect matchings
Matching_(graph_theory)
American mathematician and billionaire (1938–2024)
$60 million to Berkeley to establish the Simons Institute for the Theory of Computing, the world's leading institute for collaborative research in theoretical
Jim_Simons
Branch of mathematics that studies sets
Set theory is the branch of mathematical logic that studies sets, which can be informally described as collections of objects. Although objects of any
Set_theory
Hungarian-American computer scientist
Branching Programs". Theory of Computing. 1: 149–176. doi:10.4086/toc.2005.v001a008. Ajtai, M. (1996). "Generating hard instances of lattice problems (Extended
Miklós_Ajtai
Activity involving calculations or computing machinery
Computing is any goal-oriented activity that requires, benefits from, or creates computing machinery. It includes the study and experimentation of algorithmic
Computing
timeline of quantum computing and communication. Erwin Schrödinger publishes a theorem setting the basis for quantum steering and the limits of quantum
Timeline of quantum computing and communication
Timeline_of_quantum_computing_and_communication
Hungarian-American mathematician and computer scientist
problem. He is editor-in-chief of the refereed online journal Theory of Computing. Babai was also involved in the creation of the Budapest Semesters in Mathematics
László_Babai
Indian computer scientist (born 1976)
scientist at the Simons Institute for the Theory of Computing and Professor of EECS and Mathematics at the University of California, Berkeley. He did his high
Venkatesan_Guruswami
Tree node with two other nodes as descendants
annual ACM symposium on Theory of computing - STOC '81, pp. 114–122, doi:10.1145/800076.802464, S2CID 15402750 Lowest Common Ancestor of a Binary Search Tree
Lowest_common_ancestor
Israeli computer scientist
2002. In 2004, he received the Best Paper Award at ACM Symposium on Theory of Computing for Raz (2004), and the best paper award in IEEE Conference on Computational
Ran_Raz
American computer scientist (born 2000)
Institute for the Theory of Computing". simons.berkeley.edu. 9 January 2018. Retrieved 2018-11-14. "A Student Took Down One of Quantum Computing's Top Applications—Now
Ewin_Tang
Measure of graph complexity
(2022), "Fast FPT-approximation of branchwidth", Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, ACM, pp. 886–899, arXiv:2111
Clique-width
Search algorithm finding the position of a target value within a sorted array
ACM Symposium on Theory of Computing. doi:10.1145/800133.804351. Pelc, Andrzej (2002). "Searching games with errors—fifty years of coping with liars"
Binary_search
American computer scientist and educator
metrics by tree metrics". Proceedings of the 35th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery. pp. 448–455. doi:10.1145/780542
Satish_B._Rao
Complexity class of problems
Thomas J. (1978). "The complexity of satisfiability problems" (PDF). Proc. 10th Ann. ACM Symp. on Theory of Computing. pp. 216–226. MR 0521057. Kisfaludi-Bak
NP-intermediate
Class of problems solvable in polynomial time
(1971). "The Complexity of Theorem-Proving Procedures". Proceedings of the Third Annual ACM Symposium on Theory of Computing. ACM. pp. 151–158. doi:10
P_(complexity)
Type of algorithm
inapproximability". Proceedings of the thirty-fifth annual ACM symposium on Theory of computing. STOC '03. New York, NY, USA: Association for Computing Machinery. pp. 585–594
Parameterized approximation algorithm
Parameterized_approximation_algorithm
Branch of model theory that deals with computation
Computable model theory is a branch of model theory that deals with questions of computability as they apply to model-theoretic structures. Computable
Computable_model_theory
American computer scientist
were recognized with a best paper award at the 2013 Symposium on Theory of Computing. Woodruff, David Paul. "Efficient and private distance approximation
David_P._Woodruff
Computer system simulating intelligence
representation of information in symbolic form in AI and in sub-symbolic form in CI techniques. Hard computing is a conventional computing method based
Computational_intelligence
Unsolved problem in computational complexity theory
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, Association for Computing Machinery
Unique_games_conjecture
Mathematical logic concept
In computability theory, a set S of natural numbers is called computably enumerable (c.e.), recursively enumerable (r.e.), semidecidable, partially decidable
Computably_enumerable_set
Proving validity without revealing other data
Conference on Internet of Things (IThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE
Zero-knowledge_proof
Computation STACS – Symposium on Theoretical Aspects of Computer Science STOC – ACM Symposium on Theory of Computing Conferences whose topic is algorithms and data
List of computer science conferences
List_of_computer_science_conferences
boosting and parity learning,” in Proceedings of the 40th annual ACM symposium on Theory of computing (Victoria, British Columbia, Canada: ACM, 2008)
Parity_learning
Mathematical problem in cryptography
codes, and cryptography,” in Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Baltimore, MD, USA: ACM, 2005), 84–93, http://portal
Learning_with_errors
Type of computer applications
Perceptual computing is an application of Zadeh's theory of computing with words on the field of assisting people to make subjective judgments. The perceptual
Perceptual_computing
The history of computing extends beyond the history of computing hardware and modern computing technology including earlier methods that relied on pen
History_of_computing
Data structure for storing non-overlapping sets
cell probe complexity of dynamic data structures". Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89. pp. 345–354
Disjoint-set_data_structure
American computer scientist
Valiant (Unpublished manuscript 1988, ACM Symposium on Theory of Computing 1989) is the origin of boosting machine learning algorithms, which got a positive
Michael Kearns (computer scientist)
Michael_Kearns_(computer_scientist)
Academic journal
sister journal International Journal of Computer Mathematics: Computer Systems Theory, covering the theory of computing and computer systems was established
International Journal of Computer Mathematics
International_Journal_of_Computer_Mathematics
Computation model defining an abstract machine
Wang, Hao (1957). "A variant to Turing's theory of computing machines". Journal of the Association for Computing Machinery. 4: 63–92. doi:10.1145/320856
Turing_machine
Israeli-American computer scientist
Regev is an associate editor in chief of the journal Theory of Computing, and is a co-founder and organizer of the TCS+ online seminar series. In August
Oded Regev (computer scientist)
Oded_Regev_(computer_scientist)
Israeli computer scientist
Search, SIAM J. Computing 22: 1–10 (1993). 2016 (with Moni Naor) Paris Kanellakis Theory and Practice Award of the Association for Computing Machinery EATCS
Amos_Fiat
Greek-American computer scientist
presented a number of findings regarding the hardness of computing approximations at the Annual ACM Symposium on Theory of Computing of 1993. These findings
Mihalis_Yannakakis
Belgian physicist
physicist. He studies quantum information theory, nonlinear optics, optical neural networks, and reservoir computing. Serge Massar was born in Zambia in 1970
Serge_Massar
American computer scientist (born 1963)
computations in polylogarithmic time", in Proceedings of the 23rd ACM Symposium on the Theory of Computing, pages 21-31. ACM, New York, 1991 L. Fortnow and
Lance_Fortnow
Method of comparing problems by transforming one into another in computability theory
In computability theory, many reducibility relations (also called reductions, reducibilities, and notions of reducibility) are studied. They are motivated
Reduction (computability theory)
Reduction_(computability_theory)
Mathematical result
42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5–8 June 2010, Association for Computing Machinery, pp. 775–784
Johnson–Lindenstrauss_lemma
Model of computational complexity
branch of computational complexity theory in which Boolean functions are classified according to the size or depth of the Boolean circuits that compute them
Circuit_complexity
guessing game and randomized online algorithms. Annual ACM Symposium on Theory of Computing, 2000. http://portal.acm.org/citation.cfm?id=335385 A. R. Karlin
Ski_rental_problem
Theory of Computing 1998, pp. 203–208. 1998. doi:10.1145/276698.276737 Fortnow, Lance (2009), "A simple proof of Toda's theorem", Theory of Computing
Parity_P
Algorithm for public-key cryptography
information". Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82. New York, NY, USA: Association for Computing Machinery. pp. 365–377
RSA_cryptosystem
Class of models and problems in circuit complexity
"Algebraic methods in the theory of lower bounds for Boolean circuit complexity", Proc. 19th ACM Symposium on Theory of Computing, pp. 77–82, doi:10.1145/28395
ACC0
German computer scientist
of Sciences Leopoldina. Manfred Warmuth, Simons Institute in the Theory of Computing, retrieved 2023-05-17 "Manfred K. Warmuth", IEEE Xplore, IEEE, retrieved
Manfred_K._Warmuth
Whether a decision problem has an effective method to derive the answer
consequence of, and thus a member of, the theory. Every complete computably enumerable first-order theory is decidable. An extension of a decidable theory may
Decidability_(logic)
American computer scientist
promoted to manager of theory of computing. A year later, he relocated to the Almaden center in Silicon Valley to become the senior manager of the computer science
Prabhakar_Raghavan
Academic subfield of computer science
three major branches: automata theory and formal languages, computability theory, and computational complexity theory, which are linked by the question:
Theory_of_computation
Classical problem in combinatorics
degree instances", Proceedings of the thirty-third annual ACM symposium on Theory of computing, Association for Computing Machinery, pp. 453–461, doi:10
Set_cover_problem
Israeli computer scientist (born 1965)
abstract)". Proceedings of the thirty-first annual ACM symposium on Theory of Computing. STOC '99. New York, NY, US: Association for Computing Machinery. pp. 129–140
Amir_Ronen
On short connecting nets with added points
kernelization". Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (PDF). STOC 2017. New York, NY: Association for Computing Machinery. pp. 224–237
Steiner_tree_problem
Countable ordinal that is the order type of a computable well-ordering of natural numbers
specifically computability and set theory, a computable (or recursive) ordinal is an ordinal number that can be represented as a computable well-ordering of natural
Computable_ordinal
Unsolved problem in computational complexity theory
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019, Association for computing machinery
Graph_isomorphism_problem
THEORY OF-COMPUTING
THEORY OF-COMPUTING
THEORY OF-COMPUTING
THEORY OF-COMPUTING
THEORY OF-COMPUTING
THEORY OF-COMPUTING
THEORY OF-COMPUTING
THEORY OF-COMPUTING
THEORY OF-COMPUTING