Efficient algorithm for computing the Euler-Poincaré characteristic of a semi-algebraic set defined by few quadratic inequalities
Saugata Basu
Abstract
We present an algorithm which takes as input a closed semi-algebraic set, S ⊂ k, defined by \[ P1 ≤ 0, ..., P ≤ 0, Pi ∈ [X1,...,Xk], °(Pi) ≤ 2, \] and computes the Euler-Poincaré characteristic of S. The complexity of the algorithm is kO().
Create a lesson
Related papers
StabQ: Quantum Program Analysis via Weighted Stabilizer Representations
Shangzhou Xia, Junjie Luo, Jianjun Zhao
Least-Squares and Low-Rank Approximation for Linear Relations Using a Diagrammatic Language
Júlia de Araújo Mota, Iago Leal de Freitas, Lucas Rufino et al.
AutoSR: Automatic Symbolic Regression by Searching Research States
Kejia Zhang, Youran Sun, Xinyu Ren et al.
Stationarity is not enough: tightness of the quantum mechanical bootstrap and the copositive cone
Daniel Keren
Technical Report: A Formal Semantics for Java Symbolic Evaluation using Large-Block Encoding
Soha Hussein, Stephen McCamant, Kelton OBrien et al.
Complete Reduction for Derivatives in a Transcendental Liouvillian Extension
Shaoshi Chen, Hao Du, Yiman Gao et al.