Showing 211 - 220 results of 279 for search '"Computational complexity"', सवाल का समय: 0.02सेकंड परिणाम को परिष्कृत करें
  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.

खोज साधन: