Quantum algorithm for solving the test suite minimization problem
Test-suite minimization problem is an essential problem in software engineering as its application helps to improve the software quality. This paper proposes a quantum algorithm to solve the test-suite minimization problem with high probability in $$O\left({\sqrt {{2^n}} } \right)$$, where $$n$$ is...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor & Francis Group
2021-01-01
|
Series: | Cogent Engineering |
Subjects: | |
Online Access: | http://dx.doi.org/10.1080/23311916.2021.1882116 |