Using interval arithmetic to prove that a set is pathwise-connected - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2004

Using interval arithmetic to prove that a set is pathwise-connected

Fichier non déposé

Dates et versions

hal-00860627 , version 1 (10-09-2013)

Identifiants

  • HAL Id : hal-00860627 , version 1

Citer

Nicolas Delanoue, Luc Jaulin, Bertrand Cottenceau. Using interval arithmetic to prove that a set is pathwise-connected. Theoretical Computer Science, 2004. ⟨hal-00860627⟩

Collections

UNIV-ANGERS
20 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More