13603 search results - page 65 / 2721 » On the Computational Complexity of Cut-Reduction |
151
click to vote
TCS
2010
15 years 15 days ago
2010
In this paper we show that the problem of finding a chordless path between a vertex s and a vertex t containing a vertex v remains NP-complete in bipartite graphs, thereby strengt...
172
click to vote
GRID
2000
Springer
15 years 9 months ago
2000
Springer
The creation of parameter study suites has recently become a more challenging problem as the parameter studies have become multi-tiered and the computational environment has becom...
135
click to vote
ISAAC
1995
Springer
15 years 9 months ago
1995
Springer
An extended abstract of this paper will be presented at the Sixth Annual International Symposium on Algorithms and Computation.
166
click to vote
ICGI
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. This paper revisits a problem of the evaluation of computational grammatical inference (GI) systems and discusses what role complexity measures can play for the assessmen...