Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"nondeterministic polynomial time complexity"”.

  1. Solving Complex Optimization Problems with Neuromorphic VO₂-based Oscillators

    … simultaneously to create an ONN, solving nondeterministic polynomial time complexity problems, including Graph Coloring, Max-cut, and Max-3SAT. Using sub-harmonic injection locking techniques, the solution space is binarized, achieving optimal solutions within 25 oscillation cycles. …

    zurich

  2. A Serverless Discrete Optimization Service in the Cloud Based on Boolean Circuit Satisfiability

    … efficient approach to address problems in NP (nondeterministic polynomial time) by utilizing boolean circuit satisfiability. Our novel cloud service offers clients a more universal, efficient, and user-friendly solution for solving problems in NP. We proposed an enhanced boolean logical circuit …

    waterloo Repository record for A Serverless Discrete Optimization Service in the Cloud Based on Boolean Circuit Satisfiability (opens in a new tab)