×

Found 52 Documents (Results 1–52)

Algorithmic information distortions and incompressibility in uniform multidimensional networks. arXiv:1810.11719

Preprint, arXiv:1810.11719 [cs.DM] (2018).
BibTeX Cite
Full Text: arXiv

Linear Diophantine equations, group CSPs, and graph isomorphism. (English) Zbl 1410.68153

Klein, Philip N. (ed.), Proceedings of the 28th annual ACM-SIAM symposium on discrete algorithms, SODA 2017, Barcelona, Spain, January 16–19, 2017. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 327-339 (2017).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Reconstruction problems for graphs, Krawtchouk polynomials, and Diophantine equations. (English) Zbl 1246.11083

Dehmer, Matthias (ed.), Structural analysis of complex networks. Basel: Birkhäuser (ISBN 978-0-8176-4788-9/hbk; 978-0-8176-4789-6/ebook). 293-317 (2011).
PDFBibTeX XMLCite
Full Text: DOI

Isomorphism and factorization – classical and quantum algorithms. (English) Zbl 1184.11056

Arendt, Wolfgang (ed.) et al., Mathematical analysis of evolution, information, and complexity. Weinheim: Wiley-VCH (ISBN 978-3-527-40830-6/hbk). 433-453 (2009).
MSC:  11Y05 05C60 81P68 68Q05
PDFBibTeX XMLCite

Filter Results by …

Database

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

Software