Abstract
Exhibiting a deep connection between purely geometric problems and real algebra, the complexity class ∃R plays a crucial role in the study of geometric problems. Sometimes ∃R is referred to as the ‘real analog’ of NP. While NP is a class of computational problems that deals with existentially quantified boolean
... read more