13603 search results - page 323 / 2721 » On the Computational Complexity of Cut-Reduction |
157
click to vote
STACS
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We give a characterization, in terms of computational complexity, of the family Rec1 of the unary picture languages that are tiling recognizable. We introduce quasi-unary...
220
click to vote
SI3D
2003
ACM
16 years 21 days ago
2003
ACM
: We present occlusion-switches for interactive visibility culling in complex 3D environments. An occlusionswitch consists of two GPUs (graphics processing units) and each GPU is u...
197
Voted
STACS
2010
Springer
16 years 2 months ago
2010
Springer
In this paper we consider the problem of reconstructing a hidden weighted
hypergraph of constant rank using additive queries. We prove the following: Let G be
a weighted hidden h...
187
click to vote
WG
2007
Springer
16 years 1 months ago
2007
Springer
We study a variation of the vertex cover problem where it is required that the graph induced by the vertex cover is connected. We prove that this problem is polynomial in chordal g...
181
Voted
FCT
2001
Springer
15 years 12 months ago
2001
Springer
Abstract. The maximum intersection problem for a matroid and a greedoid, given by polynomial-time oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in...