Target counting with Presburger constraints and its application in sensor networks
From MaRDI portal
Publication:5160798
Recommendations
Cites work
- scientific article; zbMATH DE number 3501006 (Why is no real title available?)
- scientific article; zbMATH DE number 1313656 (Why is no real title available?)
- scientific article; zbMATH DE number 1179314 (Why is no real title available?)
- scientific article; zbMATH DE number 1859219 (Why is no real title available?)
- A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
- Complexity of Subcases of Presburger Arithmetic
- Handbook of Spatial Logics
- On the complexity of integer programming
- On the computability of region-based Euclidean logics
- Target Enumeration via Euler Characteristic Integrals
Cited in
(3)
This page was built for publication: Target counting with Presburger constraints and its application in sensor networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5160798)