Target counting with Presburger constraints and its application in sensor networks
DOI10.1098/RSPA.2019.0278zbMATH Open1472.68015OpenAlexW2989350395WikidataQ91866596 ScholiaQ91866596MaRDI QIDQ5160798FDOQ5160798
Authors: Sven Linker, Michele Sevegnani
Publication date: 29 October 2021
Published in: Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1098/rspa.2019.0278
Recommendations
mathematical modellingsensor networksPresburger arithmeticcomputational mathematicscomputer modelling and simulationmodel enumerationtarget counting
Combinatorics in computer science (68R05) Combinatorial probability (60C05) Wireless sensor networks as related to computer science (68M18)
Cites Work
- Title not available (Why is that?)
- Target Enumeration via Euler Characteristic Integrals
- A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
- Handbook of Spatial Logics
- On the complexity of integer programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complexity of Subcases of Presburger Arithmetic
- Title not available (Why is that?)
- On the computability of region-based Euclidean logics
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)