Faster access than browser!
18 relations: Angus Macintyre, Approximation algorithm, APX, Karpiński (surname), List of computer scientists, List of mathematicians (K), List of NP-complete problems, List of people by Erdős number, List of Polish mathematicians, List of Polish people, List of University of Bonn people, Matching (graph theory), NP-completeness, Polynomial-time approximation scheme, Poznań, Route inspection problem, Set packing, Wojciech Rytter.
Angus Macintyre
Angus John Macintyre FRS, FRSE (born 1941) is a British mathematician and logician known for his work in Model theory, logic, and their applications in algebra, algebraic geometry, and number theory.
New!!: Marek Karpinski and Angus Macintyre · See more »
Approximation algorithm
In computer science and operations research, approximation algorithms are efficient algorithms that find approximate solutions to NP-hard optimization problems with provable guarantees on the distance of the returned solution to the optimal one.
New!!: Marek Karpinski and Approximation algorithm · See more »
APX
In complexity theory the class APX (an abbreviation of "approximable") is the set of NP optimization problems that allow polynomial-time approximation algorithms with approximation ratio bounded by a constant (or constant-factor approximation algorithms for short).
New!!: Marek Karpinski and APX · See more »
Karpiński (surname)
Karpiński (feminine: Karpińska) is a Polish noble family name (of Karpiński family).
New!!: Marek Karpinski and Karpiński (surname) · See more »
List of computer scientists
This is a list of computer scientists, people who do work in computer science, in particular researchers and authors.
New!!: Marek Karpinski and List of computer scientists · See more »
List of mathematicians (K)
No description.
New!!: Marek Karpinski and List of mathematicians (K) · See more »
List of NP-complete problems
This is a list of some of the more commonly known problems that are NP-complete when expressed as decision problems.
New!!: Marek Karpinski and List of NP-complete problems · See more »
List of people by Erdős number
Paul Erdős (1913–1996) was the most prolifically published mathematician of all time.
New!!: Marek Karpinski and List of people by Erdős number · See more »
List of Polish mathematicians
A list of notable Polish mathematicians.
New!!: Marek Karpinski and List of Polish mathematicians · See more »
List of Polish people
This is a partial list of notable Polish or Polish-speaking or -writing persons.
New!!: Marek Karpinski and List of Polish people · See more »
List of University of Bonn people
This is a list of University of Bonn people including people who have taught or studied at the University of Bonn.
New!!: Marek Karpinski and List of University of Bonn people · See more »
Matching (graph theory)
In the mathematical discipline of graph theory, a matching or independent edge set in a graph is a set of edges without common vertices.
New!!: Marek Karpinski and Matching (graph theory) · See more »
NP-completeness
In computational complexity theory, an NP-complete decision problem is one belonging to both the NP and the NP-hard complexity classes.
New!!: Marek Karpinski and NP-completeness · See more »
Polynomial-time approximation scheme
In computer science, a polynomial-time approximation scheme (PTAS) is a type of approximation algorithm for optimization problems (most often, NP-hard optimization problems).
New!!: Marek Karpinski and Polynomial-time approximation scheme · See more »
Poznań
Poznań (Posen; known also by other historical names) is a city on the Warta River in west-central Poland, in the Greater Poland region.
New!!: Marek Karpinski and Poznań · See more »
Route inspection problem
In graph theory, a branch of mathematics and computer science, the Chinese postman problem (CPP), postman tour or route inspection problem is to find a shortest closed path or circuit that visits every edge of a (connected) undirected graph.
New!!: Marek Karpinski and Route inspection problem · See more »
Set packing
Set packing is a classical NP-complete problem in computational complexity theory and combinatorics, and was one of Karp's 21 NP-complete problems.
New!!: Marek Karpinski and Set packing · See more »
Wojciech Rytter
Wojciech Rytter is a Polish computer scientist, a professor of computer science at the University of Warsaw.
New!!: Marek Karpinski and Wojciech Rytter · See more »
