intractability
71Michael O. Rabin — Michael Oser Rabin Born September 1, 1931 (1931 09 01) (age 80) Breslau …
72Marcionism — Marcion of Sinope Marcionism was an Early Christian dualist belief system that originated in the teachings of Marcion of Sinope at Rome around the year 144;[1] see also Christianity in the 2nd century. Marcion believed Jesus Christ was the savior …
73Omar al-Bashir — Omar Hassan redirects here. For other uses, see Omar Hassan (disambiguation). Al Bashir redirects here. This may also refer to an adversary in the video game Battlefield 3. Omar al Bashir عمر البشير President of Sudan …
74Leonid Levin — Leonid Anatolievich Levin ( he. לאוניד אנטולייביץ לוין; ru. Леонид Анатольевич Левин; born November 2, 1948 in Dnipropetrovsk Ukrainian SSR) is a computer scientist. He studied under Andrey Kolmogorov.He obtained his master degree in 1970 and… …
75Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… …
76Schnorr signature — In cryptography, a Schnorr signature is a digital signature produced by the Schnorr signature algorithm. Its security is based on the intractability of certain discrete logarithm problems. It is considered the simplest digital signature scheme to …
77Complexity class — In computational complexity theory, a complexity class is a set of problems of related resource based complexity. A typical complexity class has a definition of the form: the set of problems that can be solved by an abstract machine M using… …
78David S. Johnson — For other people named David Johnson, see David Johnson (disambiguation). David Stifler Johnson (born December 9, 1945) is a computer scientist specializing in algorithms and optimization. He is currently the head of the Algorithms and… …
79Computational irreducibility — is one of the main ideas proposed by Stephen Wolfram in his book A New Kind of Science. Contents 1 The idea 2 Implications 3 Analysis 4 See also …
80Complete coloring — of the Clebsch graph with 8 colors. Every pair of colors appears on at least one edge. No complete coloring with more colors exists: in any 9 coloring some color would appear only at one vertex, and there would not be enough neighboring vertices… …
