Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

35

SIGAL
1990

favoriteEmaildiscussreport

221views Algorithms» more SIGAL 1990»

Complexity Cores and Hard Problem Instances

14 years 3 months ago

Complexity Cores and Hard Problem Instances

Download www.uni-ulm.de

Many intractable problems such as NP-complete problems (provided P = NP) have easy subproblems. In contrast, we investigate the existence and the properties of inherently hard subproblems, called complexity cores. Furthermore, the question is posed whether individual problem instances can be inherently hard (for all algorithms solving the problem), and this question is answered positively.

Uwe Schöning

Real-time Traffic

Algorithms | Individual Problem Instances | Many Intractable Problems | NP-complete Problems | SIGAL 1990 |

claim paper

Related Content

» Hard Instances of the Constrained Discrete Logarithm Problem

» If NP Languages are Hard on the WorstCase Then It is Easy to Find Their Hard Instances

» If NP Languages are Hard on the WorstCase Then it is Easy to Find Their Hard Instances

» Hard constraint satisfaction problems have hard gaps at location 1

» Walrasian Equilibrium Hardness Approximations and Tractable Instances

» Easy and hard coalition resource game formation problems a parameterized complexity analys...

» The Impact of Balancing on Problem Hardness in a Highly Structured Domain

» Towards Parallel Non Serial Dynamic Programming for Solving Hard Weighted CSP

» Generating Satisfiable Problem Instances

Post Info
More Details (n/a)

Added	11 Aug 2010
Updated	11 Aug 2010
Type	Conference
Year	1990
Where	SIGAL
Authors	Uwe Schöning

Comments (0)