default search action

combined dblp search
author search
venue search
publication search

ask others

"A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and ..."

Mohab Safey El Din, Éric Schost (2017)

> Home

Details and statistics

DOI: 10.1145/2996450

access: closed

type: Journal Article

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jacm/DinS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/DinS17
Mohab Safey El Din, Éric Schost:
A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets. J. ACM 63(6): 48:1-48:37 (2017)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.