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: Selfridge–Conway primality test | Statement: [John L. Selfridge, notableWork, Selfridge–Conway primality test]

Target entity: Selfridge–Conway primality test
Context triple: [John L. Selfridge, notableWork, Selfridge–Conway 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. Fermat primality test
  The Fermat primality test is a probabilistic algorithm that checks whether a number is prime by verifying congruences derived from Fermat's little theorem.
• C. Blum–Blum–Shub pseudorandom number generator
  The Blum–Blum–Shub pseudorandom number generator is a cryptographically secure generator based on the hardness of factoring large composite numbers, widely studied in theoretical computer science and cryptography.
• D. Carmichael number
  A Carmichael number is a composite integer that nonetheless satisfies Fermat's primality test for all bases coprime to it, making it a classic example of a Fermat pseudoprime.
• E. Berlekamp’s algorithm for factoring polynomials over finite fields
  Berlekamp’s algorithm for factoring polynomials over finite fields is a foundational deterministic method in computational algebra that efficiently decomposes polynomials into irreducible factors over finite fields and underpins many modern algorithms in coding theory and cryptography.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Entity: Selfridge–Conway primality test
Triple: [John L. Selfridge, notableWork, 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.

Target entity: Selfridge–Conway primality test
Target entity description: The Selfridge–Conway primality test is a probabilistic algorithm in number theory used to determine whether a given integer is prime.

• 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. Fermat primality test
  The Fermat primality test is a probabilistic algorithm that checks whether a number is prime by verifying congruences derived from Fermat's little theorem.
• C. Blum–Blum–Shub pseudorandom number generator
  The Blum–Blum–Shub pseudorandom number generator is a cryptographically secure generator based on the hardness of factoring large composite numbers, widely studied in theoretical computer science and cryptography.
• D. Carmichael number
  A Carmichael number is a composite integer that nonetheless satisfies Fermat's primality test for all bases coprime to it, making it a classic example of a Fermat pseudoprime.
• E. Berlekamp’s algorithm for factoring polynomials over finite fields
  Berlekamp’s algorithm for factoring polynomials over finite fields is a foundational deterministic method in computational algebra that efficiently decomposes polynomials into irreducible factors over finite fields and underpins many modern algorithms in coding theory and cryptography.
• F. None of above. chosen