Towards a Physical Oracle for the Partition Problem using Analogue Computing

Stefan Rass

Despite remarkable achievements in its practical tractability, the notorious class of NP-complete problems has been escaping all attempts to find a worst-case polynomial time-bound…