Mostrando 211 - 220 resultados de 279 para a busca '"Computation complexity."', tempo de busca: 0.01s Refinar Resultados
  1. 211

    Revisiting a result of Ko. por Cintioli, Patrizio

    Artigo

    Revisiting a result of Ko.
  2. 212

    An approximation result for a duo-processor task scheduling problem. por Olmo, P. Dell

    Artigo

    An approximation result for a duo-processor task scheduling problem.
  3. 213

    On approximating the memory-Constrained Module Allocation Problem. por Roupin, Frederic

    Artigo

    On approximating the memory-Constrained Module Allocation Problem.
  4. 214

    Polynomial algorithms for the maximum stable set problem on particular classes of P5-free graphs. por Mosca, Raffaele

    Artigo

    Polynomial algorithms for the maximum stable set problem on particular classes of P5-free graphs.
  5. 215

    Monotone real circuits are more powerful than monotone boolean circuits. por Rosenbloom, Arnold

    Artigo

    Monotone real circuits are more powerful than monotone boolean circuits.
  6. 216

    On the effect of local changes in the variable ordering of ordered decision diagrams. por Bollig, Beate

    Artigo

    On the effect of local changes in the variable ordering of ordered decision diagrams.
  7. 217

    Succinct circuit representations and leaf language classes are basically the same concept. por Borchert, Bernd

    Artigo

    Succinct circuit representations and leaf language classes are basically the same concept.
  8. 218

    On the amount of nondeterminism and the power of nondeterminism and the power of verifying. por Cai, Liming

    Artigo

    On the amount of nondeterminism and the power of nondeterminism and the power of verifying.
  9. 219

    Communication complexity of turnpike problem por Buño, Kelvin C.

    Tese

    Communication complexity of turnpike problem
  10. 220

    Visualizing large-scale genomic sequences. por Glusman, G.

    Artigo

    Visualizing large-scale genomic sequences.

Ferramentas de busca: