C. K. Yap. A new lower bound construction for commutative Thue systems, with applications. Journal of Symbolic Computation, 12:1-28, 1991. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
On Arithmetical Formulas Whose Jacobians are Gröbner Bases - Denis, Regan (2000) (Correct)
....relationship to circuit size to extend from geometric degree to arithmetic degree, this would have instantly afforded exponential lower bounds on circuit size. However, the double exponential growth in all of these quantities is realizable by the so called Mayr Meyer ideals ( MM82] see also [MM84, Huy86, BS88, Yap91]) and these can be defined by linearly many formulas of constant size and degree Moreover, the Mayr Meyer ideals can be obtained via the first partial derivatives of polynomials p n defined by multi linear read twice formulas of linear size (in unfactored form, i.e. Sigma 2 form) and constant ....
C. Yap. A new lower bound construction for commutative Thue systems with applications. Journal of Symbolic Computation, 12:1--27, 1991. 12
A Solution to Kronecker's Problem - Gallo, Mishra (1994) (Correct)
....depend on the assertion that either A 2 M or A 62 M) There have been many attempts to obtain a precise complexity of Buchberger s algorithm, but only in case of K[x 1 , x 2 , x n ] where K is a field) the bounds are known. In this case, there are fairly sharp upper and lower bounds [2, 4, 15, 18, 33] . A noteworthy attempt in this direction is due to Volker Weispfenning [32] Using the compactness theorem of first order logic, he has shown the existence of recursive bounds for the Grobner bases computation in the polynomial rings over a field, polynomial rings over a commutative regular ring ....
C.K. Yap. A New Lower Bound Construction for Commutative Thue Systems with Applications Journal of Symbolic Computation, 12:1--27, 1991.
Randomized Zero Testing of Radical Expressions and.. - Daniela Tulone Chee (1999) (1 citation) Self-citation (Yap) (Correct)
....A drawback in Wu s method is that it works with an algebraically closed eld. In particular, it is not a complete method for the real algebraic varieties. The present paper addresses a special case of real algebraic varieties. Gr obner bases methods can be doubly exponential in the worst case [17, 24]. The complexity for Wu s method is somewhat better but remains an issue. To circumvent the high complexity, we investigate probabilistic methods [20] combined with proof by example techniques [11] In probabilistic theorem proving, we do not prove the validity of a conjecture in the classical ....
C. K. Yap. A new lower bound construction for commutative Thue systems, with applications. Journal of Symbolic Computation, 12:1-28, 1991.
Randomized Zero Testing of Radical Expressions and Elementary .. - Tulone, Yap, Li (2000) (1 citation) Self-citation (Yap) (Correct)
....A drawback in Wu s method is that it works with an algebraically closed eld. In particular, it is not a complete method for the real algebraic varieties. The present paper addresses a special case of real algebraic varieties. Gr obner bases methods can be doubly exponential in the worst case [16, 21]. The complexity for Wu s method is somewhat better but remains an issue. To circumvent the high complexity, we investigate probabilistic methods [11] combined with proof by example techniques [10] In probabilistic theorem proving, we do not prove the validity of a conjecture in the classical ....
C. K. Yap. A new lower bound construction for commutative Thue systems, with applications. J. Symbolic Computation, 12:1-28, 1991.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC