Top Results for Complexity Theory

Christos Papadimitriou is a Greek-American computer scientist and professor at Columbia University. He is a prominent theorist whose work has significantly shaped computational complexity, algorithmic game theory, and the study of internet economics. He authored the 1994 textbook "Computational Comp...

Manuel Blum is a Venezuelan-American computer scientist who has served as a professor at the University of California, Berkeley, and Carnegie Mellon University. He made foundational contributions to computational complexity theory by formalizing the axioms of computational complexity and developing...

Leslie Valiant is a British computer scientist and professor at Harvard University. He is widely recognized for introducing the Probably Approximately Correct (PAC) learning model in 1984, which provided a mathematical framework for understanding machine learning and remains fundamental to computati...

Michael Rabin is an Israeli computer scientist and professor at the Hebrew University of Jerusalem who has made foundational contributions to theoretical computer science. He co-developed the theory of nondeterministic finite automata with Dana Scott, providing a fundamental mathematical model for p...

Sanjeev Arora is an American theoretical computer scientist and a professor at Princeton University. He is best known for his co-discovery of the PCP theorem in 1998, a landmark result in computational complexity theory that established the hardness of approximating many NP-hard problems. His resear...

Oded Goldreich is an Israeli computer scientist and professor at the Weizmann Institute of Science, where he conducts research in theoretical computer science. He is recognized for his extensive work in the foundations of cryptography, pseudorandomness, and computational complexity theory. He author...

Madhu Sudan is an Indian-American computer scientist at Harvard University, previously at MIT, whose work spans theoretical computer science, coding theory, and probabilistic proof systems. He made foundational contributions to list decoding of error-correcting codes and to the probabilistically che...

Subhash Khot is a professor of computer science at New York University's Courant Institute of Mathematical Sciences. In 2002 he proposed the Unique Games Conjecture, a hypothesis about the hardness of approximating certain constraint satisfaction problems that has become one of the most influential...

Russell Impagliazzo is a professor of computer science at the University of California, San Diego, specializing in computational complexity theory and cryptography. He is best known for the 'five worlds' framework, introduced in a 1995 survey paper, which classifies possible relationships among comp...

Umesh Vazirani is a professor of electrical engineering and computer sciences at the University of California, Berkeley. He is recognized for foundational contributions to quantum computing, including the 1993 paper with Ethan Bernstein that introduced the complexity class BQP and the Bernstein-Vazi...

Ran Raz is a professor of computer science at Princeton University. He is known for influential contributions to computational complexity theory, including work on interactive proof systems, probabilistically checkable proofs, and fundamental results in communication complexity where he established...

Shang-Hua Teng is a Chinese-American theoretical computer scientist at the University of Southern California. He co-developed smoothed analysis of algorithms with Daniel Spielman, a framework for analyzing algorithm performance under slight perturbations of worst-case inputs. This work was recognize...

Irit Dinur is an Israeli computer scientist at the Weizmann Institute of Science. She is best known for giving a combinatorial proof of the PCP theorem, a fundamental result in computational complexity theory that characterizes the hardness of approximation problems. Her proof was published in the J...

Ryan Williams is an American theoretical computer scientist at MIT. He is known for proving circuit complexity lower bounds and for revealing algorithmic connections between circuit complexity and algorithm design. His research has contributed to understanding the relationships between computational...

Salil Vadhan is a computer scientist at Harvard University who researches pseudorandomness, computational complexity, and privacy-preserving computation. He has developed theoretical foundations for pseudorandom generators and worked on the relationship between computational complexity and cryptogra...

Scott Aaronson is a theoretical computer scientist at UT Austin who works in quantum computing and computational complexity theory. He has contributed to understanding the capabilities and limitations of quantum computation, including work on quantum supremacy and quantum algorithm lower bounds. Aar...

Boaz Barak is a computer scientist at Harvard University who works in computational complexity theory, cryptography, and theoretical computer science. He introduced non-black-box techniques in cryptography, particularly in the context of zero-knowledge proofs, which expanded the toolkit for cryptogr...

Michael Sipser is an American theoretical computer scientist and a professor at the Massachusetts Institute of Technology (MIT), where he also served as the Dean of Science. He is the author of the widely used undergraduate textbook "Introduction to the Theory of Computation," which provides foundat...

Prasad Raghavendra is a theoretical computer scientist and professor at UC Berkeley. He is best known for proving that semidefinite programming relaxations, combined with rounding schemes, achieve the best possible approximation ratios for all constraint satisfaction problems assuming the Unique Gam...

Lenore Blum is an American mathematician and computer scientist known for co-developing the Blum-Shub-Smale model of computation over the real numbers, which provided a theoretical framework for studying the complexity of continuous numerical computation. She held a faculty position at Carnegie Mell...

Lance Fortnow is an American theoretical computer scientist recognized for his foundational work in computational complexity theory. He is best known for co-authoring the 1989 proof that established the equality of IP and PSPACE, a major milestone in the study of complexity classes. Fortnow currentl...

Dana Moshkovitz is an Israeli-American theoretical computer scientist who serves as a faculty member at the University of Texas at Austin. Her primary research area is computational complexity theory, where she focuses on probabilistically checkable proofs (PCPs) and the hardness of approximation. S...

Stephen Cook was a pioneering computer scientist recognized globally for his foundational contributions to theoretical computer science. He formalized the concept of NP-completeness during the 20th century, establishing a critical benchmark in understanding computational complexity. This work earned...

Andrew Yao is a prominent computer scientist recognized globally for his foundational work in complexity theory and theoretical computer science. His research significantly impacted areas including cryptography, communication complexity, and computation. Yao’s contributions earned him the prestigio...