Search Results

Showing 1 - 12 results of 12 for search '"NP-completeness"', query time: 1.47s Refine Results
  1. 1
    by Camur, Mustafa Can
    Published 2021
    “... known as the SDC problem, has been shown to be NP-complete. In this dissertation, we propose a new...”
    Get access
    Get access
    Text
  2. 2
    by Wareham, Harold Todd, 1963-
    Published 1992
    “... such trees have been shown to be NP-complete [Day87, DJS86, DS86, DS87, GF82, Kri88, KM86]. In this thesis, a...”
    Get access
    Thesis
  3. 3
    “...Many applications can be modeled assubgraph isomorphism problems, which are generally NP-complete...”
    Get access
    Get access
    Text
  4. 4
    by Johan Groenen
    Published 2008
    “... belongs to. These white islands are separated by a black wall, which is called Nurikabe. Since it is NP...”
    Get access
    Get access
    Text
  5. 5
    by Deschinkel, Karine, Touati, Sid
    Published 2008
    “... to optimise processor register usage in embedded systems. Our storage optimisation problem being NP-complete...”
    Get access
    Get access
    Get access
    Get access
    Conference Object
  6. 6
    by Deschinkel, Karine, Touati, Sid
    Published 2008
    “... to optimise processor register usage in embedded systems. Our storage optimisation problem being NP-complete...”
    Get access
    Get access
    Get access
    Get access
    Conference Object
  7. 7
    “... for finding good solutions for highly constrained NP-complete problems. Genetic Algorithms Direct random...”
    Get access
    Get access
    Text
  8. 8
    by Yasar, Oznur, 1978-
    Published 2008
    “.... The main result we have is that Weighted Search is an NP-complete problem. We also give comparison results...”
    Get access
    Thesis
  9. 9
    “... that the decision version of the introduced problem is NP-Complete, even for restricted families of graphs...”
    Get access
    Get access
    Get access
    Get access
    Conference Object
  10. 10
    “... that the decision version of the introduced problem is NP-Complete, even for restricted families of graphs...”
    Get access
    Get access
    Get access
    Get access
    Conference Object
  11. 11
    “... that the decision version of the introduced problem is NP-Complete, even for restricted families of graphs...”
    Get access
    Get access
    Get access
    Get access
    Conference Object
  12. 12
    “... that the decision version of the introduced problem is NP-Complete, even for restricted families of graphs...”
    Get access
    Get access
    Get access
    Get access
    Conference Object
Search Tools: Get RSS Feed