Skip to content

Author

Aayra Dhindsa Sawkmie

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Grover Search for a Threshold-Fraction Variant of the Travelling Salesman Problem: A Circuit-Level Construction

The Travelling Salesman Problem (TSP) is a classic combinatorial optimisation problem which is NP-hard in optimisation form and NP-complete as a decision problem. The standard question asks for the shortest tour that visits every city exactly once and returns to the origin. This paper studies a threshold-fraction varia...

Aayra Dhindsa Sawkmie · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.