|
Mark Jerrum
Mark Richard Jerrum (born 1955) is a British computer scientist and computational theorist. Jerrum received his Ph.D. in computer science 'On the complexity of evaluating multivariate polynomials' in 1981 from University of Edinburgh under the supervision of Leslie Valiant. He is professor of pure mathematics at Queen Mary, University of London. With his student Alistair Sinclair, Jerrum investigated the mixing behaviour of Markov chains to construct approximation algorithms for counting problems such as the computing the permanent, with applications in diverse fields such as matching algorithms, geometric algorithms, mathematical programming, statistics, physics-inspired applications, and dynamical systems. This work has been highly influential in theoretical computer science and was recognised with the Gödel Prize in 1996. A refinement of these methods led to a fully polynomial-time randomised approximation algorithm for computing the permanent, for which Jerrum and his co-aut ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Great Britain
Great Britain is an island in the North Atlantic Ocean off the northwest coast of continental Europe. With an area of , it is the largest of the British Isles, the largest European island and the ninth-largest island in the world. It is dominated by a maritime climate with narrow temperature differences between seasons. The 60% smaller island of Ireland is to the west—these islands, along with over 1,000 smaller surrounding islands and named substantial rocks, form the British Isles archipelago. Connected to mainland Europe until 9,000 years ago by a landbridge now known as Doggerland, Great Britain has been inhabited by modern humans for around 30,000 years. In 2011, it had a population of about , making it the world's third-most-populous island after Java in Indonesia and Honshu in Japan. The term "Great Britain" is often used to refer to England, Scotland and Wales, including their component adjoining islands. Great Britain and Northern Ireland now constitute the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gödel Prize
The Gödel Prize is an annual prize for outstanding papers in the area of theoretical computer science, given jointly by the European Association for Theoretical Computer Science (EATCS) and the Association for Computing Machinery Special Interest Group on Algorithms and Computational Theory (ACM SIGACT). The award is named in honor of Kurt Gödel. Gödel's connection to theoretical computer science is that he was the first to mention the " P versus NP" question, in a 1956 letter to John von Neumann in which Gödel asked whether a certain NP-complete problem could be solved in quadratic or linear time. The Gödel Prize has been awarded since 1993. The prize is awarded either at STOC (ACM Symposium on Theory of Computing, one of the main North American conferences in theoretical computer science) or ICALP (International Colloquium on Automata, Languages and Programming, one of the main European conferences in the field). To be eligible for the prize, a paper must be published ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Theoretical Computer Scientists
A theory is a rational type of abstract thinking about a phenomenon, or the results of such thinking. The process of contemplative and rational thinking is often associated with such processes as observational study or research. Theories may be scientific, belong to a non-scientific discipline, or no discipline at all. Depending on the context, a theory's assertions might, for example, include generalized explanations of how nature works. The word has its roots in ancient Greek, but in modern use it has taken on several related meanings. In modern science, the term "theory" refers to scientific theories, a well-confirmed type of explanation of nature, made in a way consistent with the scientific method, and fulfilling the criteria required by modern science. Such theories are described in such a way that scientific tests should be able to provide empirical support for it, or empirical contradiction ("falsify") of it. Scientific theories are the most reliable, rigorous, and compr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
British Computer Scientists
British may refer to: Peoples, culture, and language * British people, nationals or natives of the United Kingdom, British Overseas Territories, and Crown Dependencies. ** Britishness, the British identity and common culture * British English, the English language as spoken and written in the United Kingdom or, more broadly, throughout the British Isles * Celtic Britons, an ancient ethno-linguistic group * Brittonic languages, a branch of the Insular Celtic language family (formerly called British) ** Common Brittonic, an ancient language Other uses *''Brit(ish)'', a 2018 memoir by Afua Hirsch *People or things associated with: ** Great Britain, an island ** United Kingdom, a sovereign state ** Kingdom of Great Britain (1707–1800) ** United Kingdom of Great Britain and Ireland (1801–1922) See also * Terminology of the British Isles * Alternative names for the British * English (other) * Britannic (other) * British Isles * Brit (other) * Briton (d ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Alumni Of The University Of Edinburgh
This is a list of notable graduates as well as non-graduate former students, academic staff, and university officials of the University of Edinburgh in Scotland. It also includes those who may be considered alumni by extension, having studied at institutions that later merged with the University of Edinburgh. The university is associated with 19 Nobel Prize laureates, three Turing Award winners, an Abel Prize laureate and Fields Medallist, four Pulitzer Prize winners, three Prime Ministers of the United Kingdom, and several Olympic gold medallists. Government and politics Heads of state and government United Kingdom Cabinet and Party Leaders Scottish Cabinet and Party Leaders Current Members of the House of Commons * Wendy Chamberlain, MP for North East Fife * Joanna Cherry, MP for Edinburgh South West * Colin Clark, MP for Gordon * Anneliese Dodds, MP for Oxford East * Kate Green, MP for Stretford and Urmston * John Howell, MP for Henley * Neil Hudson, M ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Living People
Related categories * :Year of birth missing (living people) / :Year of birth unknown * :Date of birth missing (living people) / :Date of birth unknown * :Place of birth missing (living people) / :Place of birth unknown * :Year of death missing / :Year of death unknown * :Date of death missing / :Date of death unknown * :Place of death missing / :Place of death unknown * :Missing middle or first names See also * :Dead people * :Template:L, which generates this category or death years, and birth year and sort keys. : {{DEFAULTSORT:Living people 21st-century people People by status ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
1955 Births
Events January * January 3 – José Ramón Guizado becomes president of Panama. * January 17 – , the first nuclear-powered submarine, puts to sea for the first time, from Groton, Connecticut. * January 18– 20 – Battle of Yijiangshan Islands: The Chinese Communist People's Liberation Army seizes the islands from the Republic of China (Taiwan). * January 22 – In the United States, The Pentagon announces a plan to develop intercontinental ballistic missiles (ICBMs), armed with nuclear weapons. * January 23 – The Sutton Coldfield rail crash kills 17, near Birmingham, England. * January 25 – The Presidium of the Supreme Soviet of the Soviet Union announces the end of the war between the USSR and Germany, which began during World War II in 1941. * January 28 – The United States Congress authorizes President Dwight D. Eisenhower to use force to protect Formosa from the People's Republic of China. February * February 10 – The United States Sev ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Journal Of Algorithms
Elsevier () is a Dutch academic publishing company specializing in scientific, technical, and medical content. Its products include journals such as ''The Lancet'', ''Cell'', the ScienceDirect collection of electronic journals, '' Trends'', the '' Current Opinion'' series, the online citation database Scopus, the SciVal tool for measuring research performance, the ClinicalKey search engine for clinicians, and the ClinicalPath evidence-based cancer care service. Elsevier's products and services also include digital tools for data management, instruction, research analytics and assessment. Elsevier is part of the RELX Group (known until 2015 as Reed Elsevier), a publicly traded company. According to RELX reports, in 2021 Elsevier published more than 600,000 articles annually in over 2,700 journals; as of 2018 its archives contained over 17 million documents and 40,000 e-books, with over one billion annual downloads. Researchers have criticized Elsevier for its high profit margin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fulkerson Prize
The Fulkerson Prize for outstanding papers in the area of discrete mathematics is sponsored jointly by the Mathematical Optimization Society (MOS) and the American Mathematical Society (AMS). Up to three awards of $1,500 each are presented at each (triennial) International Symposium of the MOS. Originally, the prizes were paid out of a memorial fund administered by the AMS that was established by friends of the late Delbert Ray Fulkerson to encourage mathematical excellence in the fields of research exemplified by his work. The prizes are now funded by an endowment administered by MPS. Winners SourceMathematical Optimization Society* 1979: ** Richard M. Karp for classifying many important NP-complete problems. ** Kenneth Appel and Wolfgang Haken for the four color theorem. ** Paul Seymour for generalizing the max-flow min-cut theorem to matroids. * 1982: ** D.B. Judin, Arkadi Nemirovski, Leonid Khachiyan, Martin Grötschel, László Lovász and Alexander Schrijver for the e ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computing The Permanent
In linear algebra, the computation of the permanent of a matrix is a problem that is thought to be more difficult than the computation of the determinant of a matrix despite the apparent similarity of the definitions. The permanent is defined similarly to the determinant, as a sum of products of sets of matrix entries that lie in distinct rows and columns. However, where the determinant weights each of these products with a ±1 sign based on the parity of the set, the permanent weights them all with a +1 sign. While the determinant can be computed in polynomial time by Gaussian elimination, it is generally believed that the permanent cannot be computed in polynomial time. In computational complexity theory, a theorem of Valiant states that computing permanents is #P-hard, and even #P-complete for matrices in which all entries are 0 or 1 . This puts the computation of the permanent in a class of problems believed to be even more difficult to compute than NP. It is known tha ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computational Theorist
In theoretical computer science and mathematics, the theory of computation is the branch that deals with what problems can be solved on a model of computation, using an algorithm, how efficiently they can be solved or to what degree (e.g., approximate solutions versus precise ones). The field is divided into three major branches: automata theory and formal languages, computability theory, and computational complexity theory, which are linked by the question: ''"What are the fundamental capabilities and limitations of computers?".'' In order to perform a rigorous study of computation, computer scientists work with a mathematical abstraction of computers called a model of computation. There are several models in use, but the most commonly examined is the Turing machine. Computer scientists study the Turing machine because it is simple to formulate, can be analyzed and used to prove results, and because it represents what many consider the most powerful possible "reasonable" ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Approximation Algorithms
In computer science and operations research, approximation algorithms are efficient algorithms that find approximate solutions to optimization problems (in particular NP-hard problems) with provable guarantees on the distance of the returned solution to the optimal one. Approximation algorithms naturally arise in the field of theoretical computer science as a consequence of the widely believed P ≠ NP conjecture. Under this conjecture, a wide class of optimization problems cannot be solved exactly in polynomial time. The field of approximation algorithms, therefore, tries to understand how closely it is possible to approximate optimal solutions to such problems in polynomial time. In an overwhelming majority of the cases, the guarantee of such algorithms is a multiplicative one expressed as an approximation ratio or approximation factor i.e., the optimal solution is always guaranteed to be within a (predetermined) multiplicative factor of the returned solution. However, there are a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
