432 search results - page 8 / 87 » Open Problems with Part-Whole Relations |
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We consider repetitions in words and solve a longstanding open problem about the relation between the period and the length of its longest unbordered factor. A word u is called bor...
WADS
2005
Springer
14 years 2 months ago
2005
Springer
Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
It is a longstanding open problem to devise an oracle relative to which BQP does not lie in the Polynomial-Time Hierarchy (PH). We advance a natural conjecture about the capacity ...
EUROPAR
2004
Springer
14 years 1 months ago
2004
Springer
The APART working group is developing the APART Test Suite (ATS) for evaluating (automatic) performance analysis tools with respect to their correctness – that is, their ability...
SIGARCH
2008
13 years 8 months ago
2008
This paper presents the OpenDF framework and recalls that dataflow programming was once invented to address the problem of parallel computing. We discuss the problems with an impe...