Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

ENTCS
2008

favoriteEmaildiscussreport

106views more ENTCS 2008»

Computability and Representations of the Zero Set

13 years 4 months ago

Computability and Representations of the Zero Set

Download homepages.cwi.nl

In this note we give a new representation for closed sets under which the robust zero set of a function is computable. We call this representation the component cover representation. The computation of the zero set is based on topological index theory, the most powerful tool for finding robust solutions of equations.

Pieter Collins

Real-time Traffic

ENTCS 2008 | Powerful Tool | Robust Zero | Topological Index Theory |

claim paper

Related Content

» Pseudozero set of interval polynomials

» A Note on the Computation of All Zeros of Simple Quaternionic Polynomials

» Shape Representation via Harmonic Embedding

» Sparse Finite Elements for Geodesic Contours with LevelSets

» Calculation of Unate Cube Set Algebra Using ZeroSuppressed BDDs

» Sparse Finite Element LevelSets for Anisotropic Boundary Detection in 3D Images

» ZeroKnowledge Sets

» Symmetric Item Set Mining Based on ZeroSuppressed BDDs

» ProgressionFree Sets and Sublinear PairingBased NonInteractive ZeroKnowledge Arguments

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	ENTCS
Authors	Pieter Collins

Comments (0)