197,977 research outputs found
L'allenatore con M. Lippi. Presiede Stefano Ecchia.Ciclo di seminari sull'Industria del calcio a cura N. De Ianni e P. Varvaro
No full textIl ministro soldatoPresentazione del volume di N. De Ianni Vita di Guido Jung, Rubbettino, 2009 con l'intervento di F. Amatori, A. Battilocchi, D. Fausto, M. Franzinelli
No full textComputation models for parameterized complexity
No full textA parameterized computational problem is a set of pairs 〈x, k〉, where k is a distinguished item called "parameter". FPT is the class of fixed-parameter tractable problems: for any fixed value of k, they are solvable in time bounded by a polynomial of degree α, where a is a constant not dependent on the parameter. In order to deal with parameterized intractability, Downey and Fellows have introduced a hierarchy of classes W[I] ⊆ W[2] ⊆ ⋯ containing likely intractable parameterized problems, and they have shown that such classes have many natural, complete languages. In this paper we analyze several variations of the halting problem for nondeterministic Turing machines with parameterized time, and we show that its parameterized complexity strongly depends on some resources like the number of tapes, head and internal states, and on the size of the alphabet. Notice that classical polynomial-time complexity fails in distinguishing such features. As byproducts, we show that parameterized complexity is a useful tool for the study of the intrinsic power of some computational models, and we underline the different "computational powers" of some levels of the parameterized hierarchy
Parameterized parallel complexity
No full textWe introduce a framework to study the parallel complexity of parameterized problems, and we propose some analogs of NC
Interval Routing & Layered Cross Product: Compact Routing Schemes for Butterflies, Mesh of Trees and Fat Trees
No full textInterval Routing & Layered Cross Product: Compact Routing Schemes for Butterflies, Mesh of Trees and Fat Trees (Extended Abstract)
No full text- …
