Sciweavers

82 search results - page 12 / 17
» Two Results on Real Zeros of Chromatic Polynomials
Sort
View
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
14 years 6 days ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
ICIP
1998
IEEE
14 years 9 months ago
Complex Representations of Algebraic Curves
In this work, we employ a complex representation for an algebraic curve, and illustrate how the algebraic transformation which relates two Euclidean equivalent curves can be deter...
Mustafa Unel, William A. Wolovich
CORR
2010
Springer
77views Education» more  CORR 2010»
13 years 7 months ago
Triangular Decomposition of Semi-algebraic Systems
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations o...
Changbo Chen, James H. Davenport, John P. May, Mar...
IJBC
2006
91views more  IJBC 2006»
13 years 7 months ago
Limit Cycles for Generalized Abel Equations
This paper deals with the problem of finding upper bounds on the number of periodic solutions of a class of one-dimensional non-autonomous differential equations: those with the r...
Armengol Gasull, Antoni Guillamon
CORR
2011
Springer
158views Education» more  CORR 2011»
13 years 2 months ago
SqFreeEVAL: An (almost) optimal real-root isolation algorithm
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
Michael Burr, Felix Krahmer