検索結果 211 - 220 結果 / 279 検索語 '"Computational complexity."', 処理時間: 0.02秒 結果の絞り込み
  1. 211

    Revisiting a result of Ko. 著者: Cintioli, Patrizio

    論文

    Revisiting a result of Ko.
  2. 212

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

    論文

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

    On approximating the memory-Constrained Module Allocation Problem. 著者: Roupin, Frederic

    論文

    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. 著者: Mosca, Raffaele

    論文

    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. 著者: Rosenbloom, Arnold

    論文

    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. 著者: Bollig, Beate

    論文

    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. 著者: Borchert, Bernd

    論文

    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. 著者: Cai, Liming

    論文

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

    Communication complexity of turnpike problem 著者: Buño, Kelvin C.

    学位論文

    Communication complexity of turnpike problem
  10. 220

    Visualizing large-scale genomic sequences. 著者: Glusman, G.

    論文

    Visualizing large-scale genomic sequences.

検索ツール: