Triple

Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).

Phrase: Solovay–Strassen primality test | Statement: [Fermat primality test, isLessReliableThan, Solovay–Strassen primality test]

Target entity: Solovay–Strassen primality test
Context triple: [Fermat primality test, isLessReliableThan, Solovay–Strassen primality test]

• A. Adleman–Pomerance–Rumely primality test
  The Adleman–Pomerance–Rumely primality test is an early deterministic algorithm in computational number theory used to determine whether a given number is prime, notable for its theoretical importance in the development of modern primality testing methods.
• B. AKS primality test
  The AKS primality test is a landmark deterministic polynomial-time algorithm that can conclusively determine whether a number is prime without relying on unproven assumptions.
• C. Selfridge–Conway primality test
  The Selfridge–Conway primality test is a probabilistic algorithm in number theory used to determine whether a given integer is prime.
• D. Miller primality test
  The Miller primality test is a randomized algorithm used to determine whether a number is prime with high confidence, forming the basis of the widely used Miller–Rabin primality test in computational number theory and cryptography.
• E. Pratt certificates for primality
  Pratt certificates for primality are a method of providing short, efficiently verifiable proofs that a given number is prime, forming one of the earliest practical systems for primality certification.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Solovay–Strassen primality test
Target entity description: The Solovay–Strassen primality test is a randomized algorithm in number theory that uses Euler–Jacobi pseudoprimes to more reliably distinguish prime numbers from composites than simpler tests like Fermat’s.

• A. Adleman–Pomerance–Rumely primality test
  The Adleman–Pomerance–Rumely primality test is an early deterministic algorithm in computational number theory used to determine whether a given number is prime, notable for its theoretical importance in the development of modern primality testing methods.
• B. AKS primality test
  The AKS primality test is a landmark deterministic polynomial-time algorithm that can conclusively determine whether a number is prime without relying on unproven assumptions.
• C. Selfridge–Conway primality test
  The Selfridge–Conway primality test is a probabilistic algorithm in number theory used to determine whether a given integer is prime.
• D. Miller primality test
  The Miller primality test is a randomized algorithm used to determine whether a number is prime with high confidence, forming the basis of the widely used Miller–Rabin primality test in computational number theory and cryptography.
• E. Pratt certificates for primality
  Pratt certificates for primality are a method of providing short, efficiently verifiable proofs that a given number is prime, forming one of the earliest practical systems for primality certification.
• F. None of above. chosen