• DISCOVERER

  • Referenced in 56 articles [sw07719]
  • consists of polynomial equations and polynomial inequalities. Algorithms for quantifier elimination of real closed fields ... Based on the work of complete discrimination systems of polynomials [33,31],, we invented...
  • Tyrolean

  • Referenced in 89 articles [sw07830]
  • term rewrite systems. It is the completely redesigned successor of TTT. Current (non-)termination techniques ... lexicographic path order, loop detection, matrix interpretation, polynomial interpretation, predictive labeling, recursive SCC, root-labeling...
  • DAISY

  • Referenced in 46 articles [sw09059]
  • polynomial or rational equations. Our goal is to provide the biological investigator a completely automatized...
  • MPFI

  • Referenced in 42 articles [sw00597]
  • completely acceptable. Eventually, some applications based on MPFI are given: robotics, isolation of polynomial real...
  • R-MAX

  • Referenced in 32 articles [sw02539]
  • reward in polynomial time. In R-MAX, the agent always maintains a complete, but possibly...
  • dReal

  • Referenced in 29 articles [sw07157]
  • polynomials, trigonometric functions, exponential functions, etc. dReal implements the framework of δ -complete decision procedures...
  • QuillenSuslin

  • Referenced in 13 articles [sw08611]
  • module over a polynomial ring. In terms of matrices, this algorithm completes a unimodular rectangular ... invertible matrix over the given polynomial ring with rational or integer coefficients. The package...
  • Ginv

  • Referenced in 8 articles [sw00350]
  • differential, and difference equations of polynomial type by their completion to involution. The system ... involutive Janet and Janet-like bases for polynomial ideals and modules, as well as reduced...
  • Aligator

  • Referenced in 10 articles [sw00029]
  • ideal of polynomial invariants by variable elimination, invariant filtering and completeness check of the resulting...
  • quadeig

  • Referenced in 32 articles [sw11532]
  • algorithm for the complete solution of quadratic eigenvalue problems. We develop a new algorithm ... left eigenvectors of dense quadratic matrix polynomials. It incorporates scaling of the problem parameters prior...
  • PARTITIONS

  • Referenced in 10 articles [sw06644]
  • most m parts (using the quasi-polynomial ansatz). The purpose of this short article ... alia) completely automatically discovers, and then proves, explicit expressions (as sums of quasi-polynomials...
  • GenPSAT

  • Referenced in 4 articles [sw24009]
  • complete and we present a polynomial reduction to Mixed-Integer Programming. Capitalizing on this translation ... previously observed for many other NP-complete problems, we are able to detect a phase...
  • bv2epr

  • Referenced in 7 articles [sw07142]
  • argued that bit-blasting is not polynomial in general, and then showed that solving quantifier ... NExpTime-complete. In this paper, we present a tool based on a new polynomial translation...
  • ANOVAapprox

  • Referenced in 3 articles [sw40667]
  • multivariate functions with low-dimensional structures using polynomial bases. In this paper we propose ... finite intervals with respect to complete orthonormal systems of polynomials. An important tool for this...
  • SymProve3

  • Referenced in 2 articles [sw09242]
  • variables by making use of complete discrimination systems for polynomials. This approach is implemented into...
  • LIPSAT

  • Referenced in 6 articles [sw28633]
  • that guarantee polynomial size witnesses, placing LIPSAT complexity in the NP-complete class. An exact...
  • THEOPOGLES

  • Referenced in 2 articles [sw10105]
  • first-order polynomials and a special Knuth-Bendix procedure. THEOPOGLES is a complete theorem prover ... special Knuth-Bendix completion procedure working on First-Order Polynomials. The method does not need...
  • TSOTool

  • Referenced in 5 articles [sw10131]
  • compliance completely is an NP-completeproblem, we describe a new polynomial timealgorithm which is incorporated...
  • SLIDE

  • Referenced in 9 articles [sw08449]
  • propagate SLIDE and provide a complete propagator for CardPath. Since propagation is NP-hard ... identify special cases where propagation takes polynomial time. Our experiments demonstrate that using SLIDE...
  • OCTAL

  • Referenced in 2 articles [sw29609]
  • OCTAL: Optimal Completion of gene trees in polynomial time. Background: For a combination of reasons ... gene trees can impact downstream analyses, accurate completion of gene trees is desirable. Results...