Hoon Hong, Dalibor Jakus  Home/Search
Context Related
| risc.unilinz.ac.at/pub/t...9602.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: math.jussieu.fr....unilinz.ac.at (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Many problems in mathematics, logic, computer science, and engineering can be reduced to the problem of testing positiveness of polynomials. Although the problem is decidable (Tarski 1930), the general decision methods are not always practically applicable due to their high computational time requirements. Thus several partial methods were proposed in the field of term rewriting systems. In this paper, we exactly determine how much partial these methods are, and propose simpler and/or more... (Update)
Context of citations to this paper: More
.... 1994; Giesl, 1995) We found that these partial methods are in fact complete methods for testing absolute positiveness (Hong and Jakus, 1996). Since then, we also realized that most previously known formulas for univariate root bounds (Cauchy, 1829; Carmichael and...
.... polynomials, and then into non linear Diophantine constraints over the a i s and c s, by means of some (incomplete) positiveness criteria [HJ98]. 5. The Diophantine constraints are solved for variables in the interval [0; B] where B is a bound for coefficients given by the...
Cited by: More
Genetic Algorithms for Finding Polynomial - Orderings Jurgen Giesl (Correct)
TALP: A Tool for the Termination Analysis of Logic Programs - Ohlebusch, Claves.. (2000) (Correct)
Bounds for Absolute Positiveness of Multivariate Polynomials - Hong (1997) (Correct)
Active bibliography (related documents): More All
0.7: Technical Annex for the ACCLAIM Project (PE7195) - Haridi (1992) (Correct)
0.7: Parallelization of Quantifier Elimination on Workstation Network - Hong (1991) (Correct)
0.6: Quantifier Elimination for Trigonometric Polynomials by.. - Pau, Schicho (1999) (Correct)
Similar documents based on text: More All
0.1: Algorithms for Trigonometric Curves (Simplification.. - Hong, Schicho (1997) (Correct)
0.1: Control for Bounded Pseudo ARMAX Stochastic Systems via Linear.. - Wang (Correct)
0.1: Computational Real Algebraic Geometry - Mishra (1997) (Correct)
Related documents from co-citation: More All
3: Generating polynomial orderings for termination proofs - Giesl - 1995
2: A Decision Method for Elementary Algebra and Geometry (context) - Tarski - 1951
2: Termination of rewriting systems by polynomial interpretations and its implement.. (context) - Cherifa, Lescanne - 1987
BibTeX entry: (Update)
Hong, H., Jakus, D. (1996). Testing Positiveness of Polynomials. Technical Report 96-02, RISC-Linz, Johannes Kepler University, Linz, Austria. http://citeseer.ist.psu.edu/article/hong96testing.html More
@article{ hong98testing,
author = "Hoon Hong and Dalibor Jakus",
title = "Testing Positiveness of Polynomials",
journal = "Journal of Automated Reasoning",
volume = "21",
number = "1",
pages = "23--38",
year = "1998",
url = "citeseer.ist.psu.edu/article/hong96testing.html" }
Citations (may not include all citations):229 A Decision Method for Elementary Algebra and Geometry (context) - Tarski - 1951
110 the computational complexity and geometry of the first-order.. (context) - Renegar - 1992
76 Partial cylindrical algebraic decomposition for quantifier e.. (context) - Collins, Hong - 1991
58 Termination of rewriting systems by polynomial interpretatio.. (context) - Ben-Cherifa, Lescanne - 1987
49 Generating polynomial orderings for termination proofs - Giesl - 1995
47 Quantifier elimination for the elementary theory of real clo.. (context) - Collins - 1975
37 Journal of Symbolic Computation (context) - Dershowitz, rewriting - 1987
35 The complexity of linear problems in fields (context) - Weispfenning - 1988
27 Improvements in CAD--based Quantifier Elimination (context) - Hong - 1990
24 Simple solution formula construction in cylindrical algebrai.. (context) - Hong - 1992
24 An improvement of the projection operator in cylindrical alg.. (context) - Hong - 1990
21 An improved projection operator for cylindrical algebraic de.. (context) - McCallum - 1988
21 An Improved Projection Operator for Cylindrical Algebraic De.. (context) - McCallum - 1984
18 the complexity of semialgebraic sets (context) - Heintz, Roy et al. - 1989
13 Quantifier elimination for real algebra -- the cubic case - Weispfenning - 1994
12 Quantifier elimination for formulas constrained by quadratic.. (context) - Hong - 1993
10 Applying linear quantifier elimination - Loos, Weispfenning - 1993
9 Algorithms for the Geometry of SemiAlgebraic Sets (context) - Arnon - 1981
9 Cylindrical algebraic decomposition II: An adjacency algorit.. (context) - Arnon, Collins et al. - 1984
9 Solving polynomial strict inequalities using cylindrical alg.. (context) - McCallum - 1993
8 An adjacency algorithm for cylindrical algebraic decompositi.. - Arnon, Collins et al. - 1988
7 The complexity of deciding Tarski algebra (context) - Yu - 1988
6 Proving Polynomials Positive (context) - Steinbach - 1992
6 A parallel implementation of the cylindrical algebraic decom.. - Saunders, Lee et al. - 1990
5 A finite termination algorithm (context) - Lankford - 1976
5 Parallelization of quantifier elimination on a workstation n.. - Hong - 1993
4 Quantifier elimination by cylindrical algebraic decompositio.. (context) - Collins - 1994
3 A combinatorial algorithm solving some quantiifier eliminati.. (context) - Gonz'alez-Vega - 1996
2 Approximate Quantifier Elimination (context) - Hong, Neubacher - 1996
2 Generic quantifier elimination (context) - Hong - 1995
2 Termination of rewriting (context) - Steinbach - 1994
2 Approximate quantifier elimination (context) - Hong - 1995
1 Simplification of Truth Invariant CAD's and Solution Formula.. (context) - Brown, Collins - 1996
1 Improved algorithms for sign and existential quantifier elim.. (context) - Canny - 1993
Documents on the same site (http://www.math.jussieu.fr/~fermigie/fermivista/ftp/ftp.risc.uni-linz.ac.at.html): More
Parallel Implementation of Fast Algorithms for Good.. - Lauss, Zinterhof.. (1994) (Correct)
Practical Integer Division with Karatsuba Complexity - Jebelean (1997) (Correct)
A Survey on the Theorema Project - Buchberger, Jebelean, Kriftner.. (1997) (Correct)
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