يعرض 211 - 220 نتائج من 279 نتيجة بحث عن '"Computational complexity"', وقت الاستعلام: 0.01s تنقيح النتائج
  1. 211

    Revisiting a result of Ko. حسب Cintioli, Patrizio

    الحاوية / القاعدة Information processing letters.
    مقال

    Revisiting a result of Ko.
  2. 212

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

    الحاوية / القاعدة Information processing letters.
    مقال

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

    On approximating the memory-Constrained Module Allocation Problem. حسب Roupin, Frederic

    الحاوية / القاعدة Information processing letters.
    مقال

    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

    الحاوية / القاعدة Information processing letters.
    مقال

    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

    الحاوية / القاعدة Information processing letters.
    مقال

    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

    الحاوية / القاعدة Information processing letters.
    مقال

    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

    الحاوية / القاعدة Information processing letters.
    مقال

    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

    الحاوية / القاعدة SIAM journal on computing.
    مقال

    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.

    الحاوية / القاعدة IEEE Engineering in medicine and biology magazine
    مقال

    Visualizing large-scale genomic sequences.

أدوات البحث: