29 citations · 29 across the 4 of their papers we have counts for
Showing cs.SCShow all
2 papers · 1 filter
cs.SC2020
An Algorithm for Computing a Minimal Comprehensive Gröbner\, Basis of a Parametric Polynomial System
Deepak Kapur, Yiming Yang
An algorithm to generate a minimal comprehensive Gröbner\, basis of a parametric polynomial system from an arbitrary faithful comprehensive Gröbner\, system is presented. A basis o…
cs.SC2010
Unification modulo a partial theory of exponentiation
Deepak Kapur, Andrew Marshall, Paliath Narendran
Modular exponentiation is a common mathematical operation in modern cryptography. This, along with modular multiplication at the base and exponent levels (to different moduli) play…