Faster access than browser!
114 relations: Academic Press, ACM SIGACT, Acta Informatica, AdaBoost, AKS primality test, Alexander Razborov, Algorithmic game theory, Alistair Sinclair, Annals of Mathematics, Antoine Joux, Association for Computing Machinery, Avi Wigderson, Éva Tardos, Boneh–Franklin scheme, Boolean circuit, Carsten Lund, Charles Rackoff, Christos Papadimitriou, Circuit complexity, Cynthia Dwork, Dan Boneh, Daniel Spielman, Decidability (logic), Deterministic pushdown automaton, Diffie–Hellman key exchange, Distributed computing, Elsevier, Europe, European Association for Theoretical Computer Science, Finite-state machine, Fotios Zaharoglou, Géraud Sénizergues, Graph (discrete mathematics), Immerman–Szelepcsényi theorem, Information and Computation, Integer factorization, Interactive proof system, International Colloquium on Automata, Languages and Programming, Johan Håstad, John von Neumann, Joseph Halpern, Joseph S. B. Mitchell, Journal of Computer and System Sciences, Journal of the ACM, Kurt Gödel, L (complexity), László Babai, László Lovász, Learning with errors, Machine learning, ..., Madhu Sudan, Manindra Agrawal, Mario Szegedy, Mark Jerrum, Markov chain, Matthew K. Franklin, Maurice Herlihy, Michael Saks (mathematician), Moni Naor, Moshe Vardi, Natural proof, Neeraj Kayal, Neil Immerman, Nir Shavit, Nitin Saxena, Noam Nisan, Noga Alon, North America, NP-completeness, Omer Reingold, P versus NP problem, Parity function, PCP theorem, Permanent (mathematics), Peter O'Hearn, Peter Shor, PH (complexity), Pierre Wolper, Polynomial-time approximation scheme, PP (complexity), Quantum computing, Rajeev Motwani, Róbert Szelepcsényi, Robert Schapire, Ronald Fagin, Salil Vadhan, Sanjeev Arora, Seinosuke Toda, Shafi Goldwasser, Shang-Hua Teng, Shlomo Moran, Shmuel Safra, Shor's algorithm, SIAM Journal on Computing, Silvio Micali, SL (complexity), Smoothed analysis, Society for Industrial and Applied Mathematics, Steven Rudich, Streaming algorithm, Symposium on Theory of Computing, Temporal logic, Theoretical computer science, Tim Roughgarden, Time complexity, Toda's theorem, Topology, Travelling salesman problem, Upper and lower bounds, Uriel Feige, Yoav Freund, Yoram Moses, Yossi Matias, Zig-zag product. Expand index (64 more) »
Academic Press
Academic Press is an academic book publisher.
New!!: Gödel Prize and Academic Press · See more »
ACM SIGACT
ACM SIGACT or SIGACT is the Association for Computing Machinery Special Interest Group on Algorithms and Computation Theory, whose purpose is support of research in theoretical computer science.
New!!: Gödel Prize and ACM SIGACT · See more »
Acta Informatica
Acta Informatica is a peer-reviewed scientific journal publishing original research papers in computer science.
New!!: Gödel Prize and Acta Informatica · See more »
AdaBoost
AdaBoost, short for Adaptive Boosting, is a machine learning meta-algorithm formulated by Yoav Freund and Robert Schapire, who won the 2003 Gödel Prize for their work.
New!!: Gödel Prize and AdaBoost · See more »
AKS primality test
The AKS primality test (also known as Agrawal–Kayal–Saxena primality test and cyclotomic AKS test) is a deterministic primality-proving algorithm created and published by Manindra Agrawal, Neeraj Kayal, and Nitin Saxena, computer scientists at the Indian Institute of Technology Kanpur, on August 6, 2002, in a paper titled "PRIMES is in P".
New!!: Gödel Prize and AKS primality test · See more »
Alexander Razborov
Aleksandr Aleksandrovich Razborov (Алекса́ндр Алекса́ндрович Разбо́ров; born February 16, 1963), sometimes known as Sasha Razborov, is a Soviet and Russian mathematician and computational theorist.
New!!: Gödel Prize and Alexander Razborov · See more »
Algorithmic game theory
Algorithmic game theory is an area in the intersection of game theory and computer science, whose objective is to understand and design algorithms in strategic environments.
New!!: Gödel Prize and Algorithmic game theory · See more »
Alistair Sinclair
Alistair Sinclair (born 1960) is a British computer scientist and computational theorist.
New!!: Gödel Prize and Alistair Sinclair · See more »
Annals of Mathematics
The Annals of Mathematics is a bimonthly mathematical journal published by Princeton University and the Institute for Advanced Study.
New!!: Gödel Prize and Annals of Mathematics · See more »
Antoine Joux
Antoine Joux (born 1967) is a French cryptographer,, Bulletin de la société informatique de France – numéro 1, septembre 2013 one of the three 2013 Gödel Prize laureates., specifically cited for his paper A one round protocol for tripartite Diffie-Hellman.
New!!: Gödel Prize and Antoine Joux · See more »
Association for Computing Machinery
The Association for Computing Machinery (ACM) is an international learned society for computing.
New!!: Gödel Prize and Association for Computing Machinery · See more »
Avi Wigderson
Avi Wigderson (אבי ויגדרזון; born 9 September 1956) is an Israeli mathematician and computer scientist.
New!!: Gödel Prize and Avi Wigderson · See more »
Éva Tardos
Éva Tardos (born 1 October 1957) is a Hungarian mathematician and the Jacob Gould Schurman Professor of Computer Science at Cornell University.
New!!: Gödel Prize and Éva Tardos · See more »
Boneh–Franklin scheme
The Boneh–Franklin scheme is an identity-based encryption system proposed by Dan Boneh and Matthew K. Franklin in 2001.
New!!: Gödel Prize and Boneh–Franklin scheme · See more »
Boolean circuit
In computational complexity theory and circuit complexity, a Boolean circuit is a mathematical model for digital logic circuits.
New!!: Gödel Prize and Boolean circuit · See more »
Carsten Lund
Carsten Lund (born July 1, 1963) is a Danish-born theoretical computer scientist, currently working at AT&T Labs in Bedminster, New Jersey, United States.
New!!: Gödel Prize and Carsten Lund · See more »
Charles Rackoff
Charles Weill Rackoff is an American cryptologist.
New!!: Gödel Prize and Charles Rackoff · See more »
Christos Papadimitriou
Christos Harilaos Papadimitriou (Greek: Χρήστος Χαρίλαος Παπαδημητρίου; born August 16, 1949) is a Greek theoretical computer scientist, and professor of Computer Science at Columbia University.
New!!: Gödel Prize and Christos Papadimitriou · See more »
Circuit complexity
In theoretical computer science, circuit complexity is a branch of computational complexity theory in which Boolean functions are classified according to the size or depth of Boolean circuits that compute them.
New!!: Gödel Prize and Circuit complexity · See more »
Cynthia Dwork
Cynthia Dwork (born 1958) is an American computer scientist at Harvard University, where she is Gordon McKay Professor of Computer Science, Radcliffe Alumnae Professor at the Radcliffe Institute for Advanced Study, and Affiliated Professor, Harvard Law School.
New!!: Gödel Prize and Cynthia Dwork · See more »
Dan Boneh
Dan Boneh (דן בונה) is a teacher and researcher in applied cryptography and computer security.
New!!: Gödel Prize and Dan Boneh · See more »
Daniel Spielman
Daniel Alan Spielman (born March 1970 in Philadelphia, Pennsylvania) has been a professor of applied mathematics and computer science at Yale University since 2006.
New!!: Gödel Prize and Daniel Spielman · See more »
Decidability (logic)
In logic, the term decidable refers to the decision problem, the question of the existence of an effective method for determining membership in a set of formulas, or, more precisely, an algorithm that can and will return a boolean true or false value that is correct (instead of looping indefinitely, crashing, returning "don't know" or returning a wrong answer).
New!!: Gödel Prize and Decidability (logic) · See more »
Deterministic pushdown automaton
In automata theory, a deterministic pushdown automaton (DPDA or DPA) is a variation of the pushdown automaton.
New!!: Gödel Prize and Deterministic pushdown automaton · See more »
Diffie–Hellman key exchange
Diffie–Hellman key exchange (DH)Synonyms of Diffie–Hellman key exchange include.
New!!: Gödel Prize and Diffie–Hellman key exchange · See more »
Distributed computing
Distributed computing is a field of computer science that studies distributed systems.
New!!: Gödel Prize and Distributed computing · See more »
Elsevier
Elsevier is an information and analytics company and one of the world's major providers of scientific, technical, and medical information.
New!!: Gödel Prize and Elsevier · See more »
Europe
Europe is a continent located entirely in the Northern Hemisphere and mostly in the Eastern Hemisphere.
New!!: Gödel Prize and Europe · See more »
European Association for Theoretical Computer Science
The European Association for Theoretical Computer Science (EATCS) is an international organization with a European focus, founded in 1972.
New!!: Gödel Prize and European Association for Theoretical Computer Science · See more »
Finite-state machine
A finite-state machine (FSM) or finite-state automaton (FSA, plural: automata), finite automaton, or simply a state machine, is a mathematical model of computation.
New!!: Gödel Prize and Finite-state machine · See more »
Fotios Zaharoglou
Fotios Zaharoglou (Φώτιος Ζαχάρογλου) is a Greek computer scientist.
New!!: Gödel Prize and Fotios Zaharoglou · See more »
Géraud Sénizergues
Géraud Sénizergues (born 1957) is a French computer scientist at the University of Bordeaux.
New!!: Gödel Prize and Géraud Sénizergues · See more »
Graph (discrete mathematics)
In mathematics, and more specifically in graph theory, a graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense "related".
New!!: Gödel Prize and Graph (discrete mathematics) · See more »
Immerman–Szelepcsényi theorem
In computational complexity theory, the Immerman–Szelepcsényi theorem states that nondeterministic space complexity classes are closed under complementation.
New!!: Gödel Prize and Immerman–Szelepcsényi theorem · See more »
Information and Computation
Information and Computation is a computer science journal published by Elsevier (formerly Academic Press).
New!!: Gödel Prize and Information and Computation · See more »
Integer factorization
In number theory, integer factorization is the decomposition of a composite number into a product of smaller integers.
New!!: Gödel Prize and Integer factorization · See more »
Interactive proof system
In computational complexity theory, an interactive proof system is an abstract machine that models computation as the exchange of messages between two parties.
New!!: Gödel Prize and Interactive proof system · See more »
International Colloquium on Automata, Languages and Programming
ICALP, the International Colloquium on Automata, Languages and Programming is an academic conference organized annually by the European Association for Theoretical Computer Science and held in different locations around Europe.
New!!: Gödel Prize and International Colloquium on Automata, Languages and Programming · See more »
Johan Håstad
Johan Torkel Håstad (born 19 November 1960) is a Swedish theoretical computer scientist most known for his work on computational complexity theory.
New!!: Gödel Prize and Johan Håstad · See more »
John von Neumann
John von Neumann (Neumann János Lajos,; December 28, 1903 – February 8, 1957) was a Hungarian-American mathematician, physicist, computer scientist, and polymath.
New!!: Gödel Prize and John von Neumann · See more »
Joseph Halpern
Joseph Yehuda Halpern (born 1953) is a professor of computer science at Cornell University.
New!!: Gödel Prize and Joseph Halpern · See more »
Joseph S. B. Mitchell
Joseph S. B. Mitchell is an American computer scientist and mathematician.
New!!: Gödel Prize and Joseph S. B. Mitchell · See more »
Journal of Computer and System Sciences
The Journal of Computer and System Sciences (JCSS) is a peer-reviewed scientific journal in the field of computer science.
New!!: Gödel Prize and Journal of Computer and System Sciences · See more »
Journal of the ACM
The Journal of the ACM is a peer-reviewed scientific journal covering computer science in general, especially theoretical aspects.
New!!: Gödel Prize and Journal of the ACM · See more »
Kurt Gödel
Kurt Friedrich Gödel (April 28, 1906 – January 14, 1978) was an Austrian, and later American, logician, mathematician, and philosopher.
New!!: Gödel Prize and Kurt Gödel · See more »
L (complexity)
In computational complexity theory, L (also known as LSPACE or DLOGSPACE) is the complexity class containing decision problems that can be solved by a deterministic Turing machine using a logarithmic amount of writable memory space.
New!!: Gödel Prize and L (complexity) · See more »
László Babai
László "Laci" Babai (born July 20, 1950 in Budapest) from Babai's web site, retrieved 2016-01-28.
New!!: Gödel Prize and László Babai · See more »
László Lovász
László Lovász (born March 9, 1948) is a Hungarian mathematician, best known for his work in combinatorics, for which he was awarded the Wolf Prize and the Knuth Prize in 1999, and the Kyoto Prize in 2010.
New!!: Gödel Prize and László Lovász · See more »
Learning with errors
Learning with errors (LWE) is a problem in machine learning that is conjectured to be hard to solve.
New!!: Gödel Prize and Learning with errors · See more »
Machine learning
Machine learning is a subset of artificial intelligence in the field of computer science that often uses statistical techniques to give computers the ability to "learn" (i.e., progressively improve performance on a specific task) with data, without being explicitly programmed.
New!!: Gödel Prize and Machine learning · See more »
Madhu Sudan
Madhu Sudan (born September 12, 1966) is an Indian-American computer scientist.
New!!: Gödel Prize and Madhu Sudan · See more »
Manindra Agrawal
Manindra Agrawal (born 20 May 1966) is a professor at the Department of Computer Science and Engineering and the Deputy Director at the Indian Institute of Technology, Kanpur.
New!!: Gödel Prize and Manindra Agrawal · See more »
Mario Szegedy
Mario Szegedy (born October 23, 1960) is a Hungarian-American computer scientist, professor of computer science at Rutgers University.
New!!: Gödel Prize and Mario Szegedy · See more »
Mark Jerrum
Mark Richard Jerrum (born 1955) is a British computer scientist and computational theorist.
New!!: Gödel Prize and Mark Jerrum · See more »
Markov chain
A Markov chain is "a stochastic model describing a sequence of possible events in which the probability of each event depends only on the state attained in the previous event".
New!!: Gödel Prize and Markov chain · See more »
Matthew K. Franklin
Matthew Keith "Matt" Franklin is an American cryptographer, and a professor of computer science at the University of California, Davis.
New!!: Gödel Prize and Matthew K. Franklin · See more »
Maurice Herlihy
Maurice Peter Herlihy (born 4 January 1954) is a computer scientist active in the field of multiprocessor synchronization.
New!!: Gödel Prize and Maurice Herlihy · See more »
Michael Saks (mathematician)
Michael Ezra Saks is an American mathematician.
New!!: Gödel Prize and Michael Saks (mathematician) · See more »
Moni Naor
Moni Naor (מוני נאור) is an Israeli computer scientist, currently a professor at the Weizmann Institute of Science.
New!!: Gödel Prize and Moni Naor · See more »
Moshe Vardi
Moshe Ya'akov Vardi (משה יעקב ורדי) is an Israeli mathematician and computer scientist.
New!!: Gödel Prize and Moshe Vardi · See more »
Natural proof
In computational complexity theory, a natural proof is a certain kind of proof establishing that one complexity class differs from another one.
New!!: Gödel Prize and Natural proof · See more »
Neeraj Kayal
Neeraj Kayal (नीरज कयाल) is an Indian computer scientist.
New!!: Gödel Prize and Neeraj Kayal · See more »
Neil Immerman
Neil Immerman (24 November 1953, Manhasset, New York) is an American theoretical computer scientist, a professor of computer science at the University of Massachusetts Amherst.
New!!: Gödel Prize and Neil Immerman · See more »
Nir Shavit
Nir Shavit (ניר שביט) is an Israeli computer scientist.
New!!: Gödel Prize and Nir Shavit · See more »
Nitin Saxena
Nitin Saxena (नितिन सक्सेना) (born 3 May 1981) is an Indian scientist in mathematics and theoretical computer science.
New!!: Gödel Prize and Nitin Saxena · See more »
Noam Nisan
Noam Nisan (נעם ניסן; born June 20, 1961) is an Israeli computer scientist, a professor of computer science at the Hebrew University of Jerusalem.
New!!: Gödel Prize and Noam Nisan · See more »
Noga Alon
Noga Alon (נוגה אלון; born 17 February 1956) is an Israeli mathematician noted for his contributions to combinatorics and theoretical computer science, having authored hundreds of papers.
New!!: Gödel Prize and Noga Alon · See more »
North America
North America is a continent entirely within the Northern Hemisphere and almost all within the Western Hemisphere; it is also considered by some to be a northern subcontinent of the Americas.
New!!: Gödel Prize and North America · See more »
NP-completeness
In computational complexity theory, an NP-complete decision problem is one belonging to both the NP and the NP-hard complexity classes.
New!!: Gödel Prize and NP-completeness · See more »
Omer Reingold
Omer Reingold (עומר ריינגולד) is a faculty member of the Computer Science Department at Stanford University.
New!!: Gödel Prize and Omer Reingold · See more »
P versus NP problem
The P versus NP problem is a major unsolved problem in computer science.
New!!: Gödel Prize and P versus NP problem · See more »
Parity function
In Boolean algebra, a parity function is a Boolean function whose value is 1 if and only if the input vector has an odd number of ones.
New!!: Gödel Prize and Parity function · See more »
PCP theorem
In computational complexity theory, the PCP theorem (also known as the PCP characterization theorem) states that every decision problem in the NP complexity class has probabilistically checkable proofs (proofs that can be checked by a randomized algorithm) of constant query complexity and logarithmic randomness complexity (uses a logarithmic number of random bits).
New!!: Gödel Prize and PCP theorem · See more »
Permanent (mathematics)
In linear algebra, the permanent of a square matrix is a function of the matrix similar to the determinant.
New!!: Gödel Prize and Permanent (mathematics) · See more »
Peter O'Hearn
Peter William O'Hearn One or more of the preceding sentences incorporates text from the royalsociety.org website where: (born 13 July 1963) is a Research Scientist at Facebook and a Professor of Computer science at University College London (UCL).
New!!: Gödel Prize and Peter O'Hearn · See more »
Peter Shor
Peter Williston Shor (born August 14, 1959) is an American professor of applied mathematics at MIT.
New!!: Gödel Prize and Peter Shor · See more »
PH (complexity)
In computational complexity theory, the complexity class PH is the union of all complexity classes in the polynomial hierarchy: PH was first defined by Larry Stockmeyer.
New!!: Gödel Prize and PH (complexity) · See more »
Pierre Wolper
Pierre Wolper is a Belgian computer scientist at the University of Liège.
New!!: Gödel Prize and Pierre Wolper · See more »
Polynomial-time approximation scheme
In computer science, a polynomial-time approximation scheme (PTAS) is a type of approximation algorithm for optimization problems (most often, NP-hard optimization problems).
New!!: Gödel Prize and Polynomial-time approximation scheme · See more »
PP (complexity)
In complexity theory, PP is the class of decision problems solvable by a probabilistic Turing machine in polynomial time, with an error probability of less than 1/2 for all instances.
New!!: Gödel Prize and PP (complexity) · See more »
Quantum computing
Quantum computing is computing using quantum-mechanical phenomena, such as superposition and entanglement.
New!!: Gödel Prize and Quantum computing · See more »
Rajeev Motwani
Rajeev Motwani (राजीव मोटवानी; March 26, 1962 – June 5, 2009) was a professor of Computer Science at Stanford University whose research focused on theoretical computer science.
New!!: Gödel Prize and Rajeev Motwani · See more »
Róbert Szelepcsényi
Róbert Szelepcsényi (born 19 August 1966, Žilina) was a Slovak student of Hungarian descent and a member of the Faculty of Mathematics, Physics and Informatics of Comenius University in Bratislava.
New!!: Gödel Prize and Róbert Szelepcsényi · See more »
Robert Schapire
Robert Elias Schapire is an American computer scientist, former David M. Siegel '83 Professor in the computer science department at Princeton University, and has recently moved to Microsoft Research.
New!!: Gödel Prize and Robert Schapire · See more »
Ronald Fagin
Ronald Fagin (born 1945) is an American mathematician and computer scientist, and IBM Fellow at the IBM Almaden Research Center.
New!!: Gödel Prize and Ronald Fagin · See more »
Salil Vadhan
Salil Vadhan is Vicky Joseph Professor of Computer Science and Applied Mathematics at Harvard University.
New!!: Gödel Prize and Salil Vadhan · See more »
Sanjeev Arora
Sanjeev Arora (born January 1968) is an Indian American theoretical computer scientist who is best known for his work on probabilistically checkable proofs and, in particular, the PCP theorem.
New!!: Gödel Prize and Sanjeev Arora · See more »
Seinosuke Toda
is a computer scientist working at the Nihon University in Tokyo.
New!!: Gödel Prize and Seinosuke Toda · See more »
Shafi Goldwasser
Shafrira Goldwasser (שפרירה גולדווסר; born 1959) is an American-Israeli computer scientist and winner of the Turing Award in 2012.
New!!: Gödel Prize and Shafi Goldwasser · See more »
Shang-Hua Teng
Shang-Hua Teng (born 1964) is a Chinese-American computer scientist.
New!!: Gödel Prize and Shang-Hua Teng · See more »
Shlomo Moran
Shlomo Moran (שלמה מורן; born 1947) is an Israeli computer scientist, the Bernard Elkin Chair in Computer Science at the Technion – Israel Institute of Technology in Haifa, Israel.
New!!: Gödel Prize and Shlomo Moran · See more »
Shmuel Safra
Shmuel Safra (שמואל ספרא) is an Israeli computer scientist.
New!!: Gödel Prize and Shmuel Safra · See more »
Shor's algorithm
Shor's algorithm, named after mathematician Peter Shor, is a quantum algorithm (an algorithm that runs on a quantum computer) for integer factorization formulated in 1994.
New!!: Gödel Prize and Shor's algorithm · See more »
SIAM Journal on Computing
The SIAM Journal on Computing is a scientific journal focusing on the mathematical and formal aspects of computer science.
New!!: Gödel Prize and SIAM Journal on Computing · See more »
Silvio Micali
Silvio Micali (born October 13, 1954) is an Italian computer scientist at MIT Computer Science and Artificial Intelligence Laboratory and a professor of computer science in MIT's Department of Electrical Engineering and Computer Science since 1983.
New!!: Gödel Prize and Silvio Micali · See more »
SL (complexity)
In computational complexity theory, SL (Symmetric Logspace or Sym-L) is the complexity class of problems log-space reducible to USTCON (undirected s-t connectivity), which is the problem of determining whether there exists a path between two vertices in an undirected graph, otherwise described as the problem of determining whether two vertices are in the same connected component.
New!!: Gödel Prize and SL (complexity) · See more »
Smoothed analysis
Smoothed analysis is a way of measuring the complexity of an algorithm.
New!!: Gödel Prize and Smoothed analysis · See more »
Society for Industrial and Applied Mathematics
The Society for Industrial and Applied Mathematics (SIAM) is an academic association dedicated to the use of mathematics in industry.
New!!: Gödel Prize and Society for Industrial and Applied Mathematics · See more »
Steven Rudich
Steven Rudich (born October 4, 1961) is a professor in the Carnegie Mellon School of Computer Science.
New!!: Gödel Prize and Steven Rudich · See more »
Streaming algorithm
In computer science, streaming algorithms are algorithms for processing data streams in which the input is presented as a sequence of items and can be examined in only a few passes (typically just one).
New!!: Gödel Prize and Streaming algorithm · See more »
Symposium on Theory of Computing
The Annual ACM Symposium on Theory of Computing (STOC) is an academic conference in the field of theoretical computer science.
New!!: Gödel Prize and Symposium on Theory of Computing · See more »
Temporal logic
In logic, temporal logic is any system of rules and symbolism for representing, and reasoning about, propositions qualified in terms of time.
New!!: Gödel Prize and Temporal logic · See more »
Theoretical computer science
Theoretical computer science, or TCS, is a subset of general computer science and mathematics that focuses on more mathematical topics of computing and includes the theory of computation.
New!!: Gödel Prize and Theoretical computer science · See more »
Tim Roughgarden
Timothy Avelin Roughgarden is a professor in the Computer Science and Management Science and Engineering Departments at Stanford University.
New!!: Gödel Prize and Tim Roughgarden · See more »
Time complexity
In computer science, the time complexity is the computational complexity that describes the amount of time it takes to run an algorithm.
New!!: Gödel Prize and Time complexity · See more »
Toda's theorem
Toda's theorem is a result in computational complexity theory that was proven by Seinosuke Toda in his paper "PP is as Hard as the Polynomial-Time Hierarchy" (1991) and was given the 1998 Gödel Prize.
New!!: Gödel Prize and Toda's theorem · See more »
Topology
In mathematics, topology (from the Greek τόπος, place, and λόγος, study) is concerned with the properties of space that are preserved under continuous deformations, such as stretching, crumpling and bending, but not tearing or gluing.
New!!: Gödel Prize and Topology · See more »
Travelling salesman problem
The travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to the origin city?" It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.
New!!: Gödel Prize and Travelling salesman problem · See more »
Upper and lower bounds
In mathematics, especially in order theory, an upper bound of a subset S of some partially ordered set (K, ≤) is an element of K which is greater than or equal to every element of S. The term lower bound is defined dually as an element of K which is less than or equal to every element of S. A set with an upper bound is said to be bounded from above by that bound, a set with a lower bound is said to be bounded from below by that bound.
New!!: Gödel Prize and Upper and lower bounds · See more »
Uriel Feige
Uriel Feige (אוריאל פייגה) is an Israeli computer scientist who was a doctoral student of Adi Shamir.
New!!: Gödel Prize and Uriel Feige · See more »
Yoav Freund
Yoav Freund (יואב פרוינד) is an Israeli professor of computer science at the University of California San Diego who mainly works on machine learning, probability theory and related fields and applications.
New!!: Gödel Prize and Yoav Freund · See more »
Yoram Moses
Yoram Moses (יוֹרָם מוֹזֶס) is a Professor in the Electrical Engineering Department at the Technion - Israel Institute of Technology.
New!!: Gödel Prize and Yoram Moses · See more »
Yossi Matias
Yossi Matias is an Israeli computer scientist, entrepreneur and Google executive.
New!!: Gödel Prize and Yossi Matias · See more »
Zig-zag product
In graph theory, the zig-zag product of regular graphs G,H, denoted by G \circ H, takes a large graph (G) and a small graph (H), and produces a graph that approximately inherits the size of the large one but the degree of the small one.
New!!: Gödel Prize and Zig-zag product · See more »
Redirects here:
Godel Prize, Godel prize, Goedel Prize, Goedel prize, Gödel prize, Göedel Prize.
References
[1] https://en.wikipedia.org/wiki/Gödel_Prize
