The following pages link to Deepak Kapur (Q394492):
Displayed 50 items.
- On invariant checking (Q394493) (← links)
- A brief introduction to Wen-Tsun Wu's Academic career (Q413403) (← links)
- An algorithm for computing a Gröbner basis of a polynomial ideal over a ring with zero divisors (Q626888) (← links)
- Complexity of unification problems with associative-commutative operators (Q688565) (← links)
- Automating inductionless induction using test sets (Q758216) (← links)
- Semi-unification (Q808713) (← links)
- Automatic generation of polynomial invariants of bounded degree using abstract interpretation (Q859956) (← links)
- A quantifier-elimination based heuristic for automatically generating inductive assertions for programs (Q882517) (← links)
- On ground-confluence of term rewriting systems (Q913496) (← links)
- Cayley-Dixon projection operator for multi-univariate composed polynomials (Q1023264) (← links)
- (Q1057261) (redirect page) (← links)
- An \(O(| T| ^ 3)\) algorithm for testing the Church-Rosser property of Thue systems (Q1057263) (← links)
- Worst-case choice for the stable marriage problem (Q1063004) (← links)
- The Church-Rosser property and special Thue systems (Q1071759) (← links)
- A finite Thue system with decidable word problem and without equivalent finite canonical system (Q1073016) (← links)
- On sufficient-completeness and related properties of term rewriting systems (Q1077161) (← links)
- Using Gröbner bases to reason about geometry problems (Q1094150) (← links)
- Proof by consistency (Q1094888) (← links)
- Computability and implementability issues in abstract data types (Q1095645) (← links)
- Complexity of matching problems (Q1099615) (← links)
- Only prime superpositions need be considered in the Knuth-Bendix completion procedure (Q1106657) (← links)
- Problem corner: Proving equivalence of different axiomatizations of free groups (Q1108815) (← links)
- Computing a Gröbner basis of a polynomial ideal over a Euclidean domain (Q1111629) (← links)
- Wu's method and its application to perspective viewing (Q1115642) (← links)
- A multi-level geometric reasoning system for vision (Q1116357) (← links)
- A refutational approach to geometry theorem proving (Q1124373) (← links)
- Conditional congruence closure over uninterpreted and interpreted symbols (Q1730315) (← links)
- Using an induction prover for verifying arithmetic circuits (Q1856145) (← links)
- Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation (Q1878474) (← links)
- A path ordering for proving termination of AC rewrite systems (Q1891259) (← links)
- New uses of linear arithmetic in automated theorem proving by induction (Q1915133) (← links)
- An efficient algorithm for computing a comprehensive Gröbner system of a parametric polynomial system (Q1930150) (← links)
- An efficient method for computing comprehensive Gröbner bases (Q1940934) (← links)
- Deciding the word problem for ground and strongly shallow identities w.r.t. extensional symbols (Q2090128) (← links)
- Deciding the word problem for ground identities with commutative and extensional symbols (Q2096444) (← links)
- Algorithms for computing greatest common divisors of parametric multivariate polynomials (Q2200294) (← links)
- Interpolation and amalgamation for arrays with MaxDiff (Q2233410) (← links)
- NIL: learning nonlinear interpolants (Q2305413) (← links)
- Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm (Q2402230) (← links)
- Bruno Buchberger -- a life devoted to symbolic computation (Preface to the special issue) (Q2457332) (← links)
- Generating all polynomial invariants in simple loops (Q2457430) (← links)
- Obituary: Harald Ganzinger (Q2583287) (← links)
- Sufficient-completeness, ground-reducibility and their complexity (Q2641108) (← links)
- Constructing Sylvester-type resultant matrices using the Dixon formulation (Q2643539) (← links)
- Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation (Q2643546) (← links)
- (Q2723430) (← links)
- (Q2738486) (← links)
- (Q2751759) (← links)
- (Q2751760) (← links)
- (Q2778873) (← links)