Computing Periods...

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 223
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorCho, Junheeko
dc.contributor.authorPark, Sewonko
dc.contributor.authorZiegler, Martin A.ko
dc.date.accessioned2018-12-20T06:09:47Z-
dc.date.available2018-12-20T06:09:47Z-
dc.date.created2018-12-12-
dc.date.created2018-12-12-
dc.date.created2018-12-12-
dc.date.issued2018-03-04-
dc.identifier.citation12th International Conference and Workshop on Algorithms and Computation (WALCOM), pp.132 - 143-
dc.identifier.urihttp://hdl.handle.net/10203/248179-
dc.description.abstractA period is the difference between the volumes of two semialgebraic sets. Recent research has located their worst-case complexity in low levels of the Grzegorczyk Hierarchy. The present work introduces, analyzes, and evaluates three rigorous algorithms for rigorously computing periods: a deterministic, a randomized, and a 'transcendental' one.-
dc.languageEnglish-
dc.publisherSpringer International Publishing-
dc.titleComputing Periods...-
dc.typeConference-
dc.identifier.wosid000432617800012-
dc.identifier.scopusid2-s2.0-85043322973-
dc.type.rimsCONF-
dc.citation.beginningpage132-
dc.citation.endingpage143-
dc.citation.publicationname12th International Conference and Workshop on Algorithms and Computation (WALCOM)-
dc.identifier.conferencecountryBG-
dc.identifier.conferencelocationDhaka, Bangladesh-
dc.identifier.doi10.1007/978-3-319-75172-6_12-
dc.contributor.localauthorZiegler, Martin A.-
dc.contributor.nonIdAuthorCho, Junhee-
dc.contributor.nonIdAuthorPark, Sewon-
Appears in Collection
CS-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0