The BIG O complexity

We are mainly working with Non-NP problems. In computer science complexity of an algorithm is given by "BIG O ". Is it possible to compare annealing based approach in terms of "BIG O", if we are able to map Non-NP problems into Ising or QUBO form and get correct solution using D-wave QPU? 

 

Relavent threadhttps://support.dwavesys.com/hc/en-us/community/posts/360050063794-How-to-calculate-computational-cost-of-an-annealer-based-algorithm-

0

Comments

1 comment

Please sign in to leave a comment.

Didn't find what you were looking for?

New post