RReduction
edu.jas.gbufd

Interface RReduction<C extends RegularRingElem<C>>

    • Method Detail

      • isStrongTopReducible

        boolean isStrongTopReducible(List<GenPolynomial<C>> P,                           GenPolynomial<C> A)
        Is strong top reducible. Condition is idempotent(a) == idempotent(b), for a=ldcf(A) and b=ldcf(B) and lt(B) | lt(A) for some B in F.
        Parameters:
        A - polynomial.
        P - polynomial list.
        Returns:
        true if A is string top reducible with respect to P.
      • isBooleanClosed

        boolean isBooleanClosed(GenPolynomial<C> A)
        Is boolean closed, test if A == idempotent(ldcf(A)) A.
        Parameters:
        A - polynomial.
        Returns:
        true if A is boolean closed, else false.
      • isBooleanClosed

        boolean isBooleanClosed(List<GenPolynomial<C>> F)
        Is boolean closed, test if all A in F are boolean closed.
        Parameters:
        F - polynomial list.
        Returns:
        true if F is boolean closed, else false.
      • booleanClosure

        GenPolynomial<C> booleanClosure(GenPolynomial<C> A)
        Boolean closure, compute idempotent(ldcf(A)) A.
        Parameters:
        A - polynomial.
        Returns:
        bc(A).
      • booleanRemainder

        GenPolynomial<C> booleanRemainder(GenPolynomial<C> A)
        Boolean remainder, compute idemComplement(ldcf(A)) A.
        Parameters:
        A - polynomial.
        Returns:
        br(A) = A - bc(A).
      • reducedBooleanClosure

        List<GenPolynomial<C>> reducedBooleanClosure(List<GenPolynomial<C>> F)
        Reduced boolean closure, compute BC(A) for all A in F.
        Parameters:
        F - polynomial list.
        Returns:
        red(bc(F)) = bc(red(F)).

SCaVis 2.2 © jWork.ORG