Common use of Proof of Theorem 6 Clause in Contracts

Proof of Theorem 6. 9‌ | | ∈ ≥ Theorem 6.9. There exists s(n) Θ(n) such that, for any field F with char(F) max(l + 2, 63), any ring R = Fn of size R = 2Θ(n) with Hadamard product, and any elementary symmetric polynomial φl, the (s, R)-Subset-φl problem is NP-complete. | |

Proof of Theorem 6. 9‌ | | ∈ ≥ Theorem 6.9. There exists s(n) Θ(n) such that, for any field F with char(F) max(l max(A + 2, 63), any ring R = Fn of size R = 2Θ(n) with Hadamard product, and any elementary symmetric polynomial φlφA, the (s, R)-Subset-φl φA problem is NP-complete. | |

Proof of Theorem 6. 9‌ | | ∈ ≥ Theorem 6.9. There exists s(n) ∈ Θ(n) such that, for any field F with char(F) max(l ≥ max(ℓ + 2, 63), any ring R = Fn of size R |R| = 2Θ(n) with Hadamard product, and any elementary symmetric polynomial φlφℓ, the (s, R)-Subset-φl φℓ problem is NP-complete. | |.