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: Zassenhaus algorithm for factoring polynomials over the rationals | Statement: [Hans Zassenhaus, notableWork, Zassenhaus algorithm for factoring polynomials over the rationals]

Target entity: Zassenhaus algorithm for factoring polynomials over the rationals
Context triple: [Hans Zassenhaus, notableWork, Zassenhaus algorithm for factoring polynomials over the rationals]

• A. 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.
• B. Cantor–Zassenhaus algorithm
  The Cantor–Zassenhaus algorithm is a probabilistic method used to factor polynomials over finite fields efficiently, widely employed in computational algebra and cryptography.
• C. Buchberger algorithm
  The Buchberger algorithm is a fundamental procedure in computational algebra for computing Gröbner bases of polynomial ideals, enabling systematic solutions to systems of polynomial equations.
• D. Lenstra elliptic-curve factorization method
  The Lenstra elliptic-curve factorization method is an integer factorization algorithm that uses properties of elliptic curves over finite fields to efficiently find nontrivial factors of large numbers, especially those with relatively small prime divisors.
• E. Euclidean algorithm for polynomials
  The Euclidean algorithm for polynomials is a procedure that repeatedly applies polynomial division to compute the greatest common divisor of two polynomials over a given field or ring.
• 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: Zassenhaus algorithm for factoring polynomials over the rationals
Triple: [Hans Zassenhaus, notableWork, Zassenhaus algorithm for factoring polynomials over the rationals]

The Zassenhaus algorithm for factoring polynomials over the rationals is a classical computational method that reduces rational polynomial factorization to modular factorization and then recombines the results using lifting techniques.

Target entity: Zassenhaus algorithm for factoring polynomials over the rationals
Target entity description: The Zassenhaus algorithm for factoring polynomials over the rationals is a classical computational method that reduces rational polynomial factorization to modular factorization and then recombines the results using lifting techniques.

• A. 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.
• B. Cantor–Zassenhaus algorithm
  The Cantor–Zassenhaus algorithm is a probabilistic method used to factor polynomials over finite fields efficiently, widely employed in computational algebra and cryptography.
• C. Buchberger algorithm
  The Buchberger algorithm is a fundamental procedure in computational algebra for computing Gröbner bases of polynomial ideals, enabling systematic solutions to systems of polynomial equations.
• D. Lenstra elliptic-curve factorization method
  The Lenstra elliptic-curve factorization method is an integer factorization algorithm that uses properties of elliptic curves over finite fields to efficiently find nontrivial factors of large numbers, especially those with relatively small prime divisors.
• E. Euclidean algorithm for polynomials
  The Euclidean algorithm for polynomials is a procedure that repeatedly applies polynomial division to compute the greatest common divisor of two polynomials over a given field or ring.
• F. None of above. chosen