Mihalis Yannakakis

Mira otros diccionarios:

• Mihalis Yannakakis — Born September 13, 1953 …   Wikipedia

• Mihalis Yannakakis — (griechisch Μιχάλης Γιαννακάκης Michalis Giannakakis; * 13. September 1953 in Athen) ist ein griechischer Informatiker. Yannakakis an der Columbia University 2006 Yannakakis erwarb 1975 sein Diplom in Elektrotechnik an der …   Deutsch Wikipedia

• Mihalis — may refer to: Mihalis Filopoulos (1985–2007), a 22 year old Panathinaikos fan who was stabbed to death in 2007 at Paiania near Athens, Greece Mihalis Hatzigiannis (born 1979), a Greek singer songwriter from Cyprus Mihalis Papagiannakis… …   Wikipedia

• National Technical University of Athens — NTUA redirects here. For the Taiwanese university, see National Taiwan University of Arts National Technical University of Athens Εθνικό Μετσόβιο Πολυτεχνείο Seal of NTUA (Prometheus Carrying Fire) Established December 31, 1836 (OS) …   Wikipedia

• Book embedding — In graph theory, book embedding is a generalization of planar embedding to nonplanar surfaces in the form of a book , a collection of pages (halfplanes) joined together at the spine of the book (the shared boundary of all the halfplanes). The… …   Wikipedia

• Премия Кнута — Гэри Миллер вручает премию 2008 года Фолькеру Штрассену Премия Кнута (англ.  …   Википедия

• Set cover problem — The set covering problem is a classical question in computer science and complexity theory. As input you are given several sets. They may have some elements in common. You must select a minimum number of these sets so that the sets you have… …   Wikipedia

• Knuth Prize — Gary Miller presents Volker Strassen with the 2008 Knuth Prize at SODA 2009. The Donald E. Knuth Prize is a prize for outstanding contributions to the foundations of computer science, named after Donald E. Knuth. Contents …   Wikipedia

• SNP (complexity) — In computational complexity theory, SNP (from Strict NP) is a complexity class containing a limited subset of NP based on its logical characterization in terms of graph theoretical properties. It forms the basis for the definition of the class… …   Wikipedia

• Vertex cover — In the mathematical discipline of graph theory, a vertex cover of a graph is a set of vertices such that each edge of the graph is incident to at least one vertex of the set. The problem of finding a minimum vertex cover is a classical… …   Wikipedia