1445 search results - page 36 / 289 » Uniformly Hard Languages |
SIAMCOMP
2011
12 years 10 months ago
2011
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
ICALP
1999
Springer
14 years 4 hour ago
1999
Springer
We demonstrate an ⍀( pn1ϩ1/p) lower bound on the average-case running time (uniform distribution) of p-pass Shellsort. This is the first nontrivial general lower bound for avera...
CONCUR
1998
Springer
13 years 12 months ago
1998
Springer
The classical theory of deterministic automata is presented in terms of the notions of homomorphism and bisimulation, which are the cornerstones of the theory of universal coalgebr...
OOGRAPHICS
1994
13 years 11 months ago
1994
class of general differentiable curves and surfaces and in turn refine this design to various parametric representations of curves and surfaces. This design includes all of the sta...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We extend the algebraic approach of Meseguer and Montanari from ordinary place/transition Petri nets to contextual nets, covering both the collective and the individual t...