Counting the number of solutions of \(^{\mathrm{K}}\)DMDGP instances. (English) Zbl 1405.05083
Nielsen, Frank (ed.) et al., Geometric science of information. First international conference, GSI 2013, Paris, France, August 28–30, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40019-3/pbk). Lecture Notes in Computer Science 8085, 224-230 (2013).
Summary: We discuss a method for finding the number of realizations in \(\mathbb R^{K }\) of certain simple undirected weighted graphs.
For the entire collection see [Zbl 1284.94005].
For the entire collection see [Zbl 1284.94005].
