The complexity class AM[k] is the set of problems that can …
The complexity class AM[k] is the set of problems that can be decided in polynomial time, with k queries and responses.
The complexity class AM[k] is the set of problems that can be decided in polynomial time, with k queries and responses.