26 search results - page 2 / 6 » mfcs 2004 |
MFCS
2004
Springer
13 years 10 months ago
2004
Springer
We consider the decidability of existence of solutions to language equations involving the operations of shuffle and deletion along trajectories. These operations generalize the o...
MFCS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Problem parameters are ubiquitous. In every area of computer science, we find all kinds of “special aspects” to the problems encountered. Hence, the study of paramet...
MFCS
2004
Springer
13 years 10 months ago
2004
Springer
How hard is it to invert NP-problems? We show that all superlinearly certified inverses of NP problems are coNP-hard. To do so, we develop a novel proof technique that builds dia...
MFCS
2004
Springer
13 years 10 months ago
2004
Springer
It was proved by [Garey and Johnson, 1983] that computing the crossing number of a graph is an NP-hard problem. Their reduction, however, used parallel edges and vertices of very h...
MFCS
2004
Springer
13 years 10 months ago
2004
Springer
We consider infinite antagonistic games over finite graphs. We present conditions that, whenever satisfied by the payoff mapping, assure for both players positional (memoryless...