6 search results - page 1 / 2 » sigal 1990 |
139
click to vote
SIGAL
1990
15 years 7 months ago
1990
In this paper we show that every 2-connected embedded planar graph with faces of sizes
143
click to vote
SIGAL
1990
15 years 7 months ago
1990
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 sub...