Marek Karpiński — (* 1948)[1] ist ein Mathematiker und Informatiker. Er ist Professor für Informatik an der Universität Bonn und Gründungsmitglied des Hausdorff Center for Mathematics. Seine Forschungsgebiete sind effiziente Algorithmen bei randomisierten und… … Deutsch Wikipedia
Karpinski — or Karpinsky may refer to:People* Alexander Karpinsky (1846–1936), Russian geologist * Alfons Karpiński (1875–1961), Polish portrait painter * Louis Charles Karpinski (1878–1956), American mathematician * Franciszek Karpiński (1741–1826), Polish… … Wikipedia
Karpinski — oder Karpiński ist der Familienname folgender Personen: Alexander Petrowitsch Karpinski (1846/47–1936), russischer Paläontologe Franciszek Karpiński (1741–1825), polnischer Dichter Jacek Karpiński (1927–2010), polnischer Pionier der Informatik… … Deutsch Wikipedia
Liste de personnes par nombre d'Erdős — Voici une liste non exhaustive de personnes ayant un nombre d Erdős de 0, 1 ou 2. Sommaire 1 #0 2 #1 3 #2 4 Référence … Wikipédia en Français
List of Poles — This is a partial list of famous Polish or Polish speaking or writing persons. In the interest of fairness and accuracy, a minority of persons of mixed heritage have their respective ancestries credited.HistoryMathematics Bartel * Stefan Banach * … Wikipedia
List of computer scientists — Expand list|date=August 2008This is a list of well known computer scientists, people who do work in computer science, in particular researchers and authors.Some persons notable as programmers are included here because they work in research as… … Wikipedia
Poznań — This article is about the city in Poland. For other uses, see Poznan (disambiguation). Poznań Top: Grand Theatre, Stary Browar and towers Upper Middle: Poznań Town Hall and market place Lower Middle: Długa Street, Jesuit College Bottom … Wikipedia
Multiplication algorithm — A multiplication algorithm is an algorithm (or method) to multiply two numbers. Depending on the size of the numbers, different algorithms are in use. Efficient multiplication algorithms have existed since the advent of the decimal system.… … Wikipedia
Combinatorial optimization — In applied mathematics and theoretical computer science, combinatorial optimization is a topic that consists of finding an optimal object from a finite set of objects.[1] In many such problems, exhaustive search is not feasible. It operates on… … Wikipedia
Approximation algorithm — In computer science and operations research, approximation algorithms are algorithms used to find approximate solutions to optimization problems. Approximation algorithms are often associated with NP hard problems; since it is unlikely that there … Wikipedia
