Buchberger

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def buchberger(unprocessed: Basis): Basis

Buchberger algorithm This function will modify the contents of the argument unprocessed

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def genMonomialOrder(predicates: Seq[Atom], baseOrder: TermOrder): MonomialOrdering

Conversion functions

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def makeMap(polylist: Seq[Polynomial]): List[Monomial]

def makeMatrix(polylist: Seq[Polynomial]): Vector[Vector[IdealInt]]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def polyToRow(poly: Polynomial, map: List[Monomial]): List[IdealInt]

def polynomialToAtom(p: Polynomial)(implicit order: TermOrder): Conjunction

Converts Polynomial (Groebner) to an Atom (Princess) PRE: p is linear

def rowToPolynomial(map: List[Monomial], row: Array[IdealInt])(implicit monOrder: MonomialOrdering): Polynomial

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit