×

Found 101 Documents (Results 1–100)

Graph pattern polynomials. (English) Zbl 1528.68269

Ganguly, Sumit (ed.) et al., 38th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2018, Ahmedabad, India, December 11–13, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 122, Article 18, 13 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Completeness for identity-free Kleene lattices. (English) Zbl 1520.68055

Schewe, Sven (ed.) et al., 29th international conference on concurrency theory. CONCUR 2018, Beijing, China, September 4–7, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 118, Article 18, 17 p. (2018).
MSC:  68Q45 68Q70 68Q85
PDFBibTeX XMLCite
Full Text: DOI

On efficiently solvable cases of quantum \(k\)-SAT. (English) Zbl 1512.68099

Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 38, 16 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Quantum curves for simple Hurwitz numbers of an arbitrary base curve. (English) Zbl 1452.14033

Liu, Chiu-Chu Melissa (ed.) et al., Topological recursion and its influence in analysis, geometry, and topology. 2016 AMS von Neumann symposium on topological recursion and its influence in analysis, geometry, and topology, Charlotte, NC, USA, July 4–8, 2016. Providence, RI: American Mathematical Society (AMS). Proc. Symp. Pure Math. 100, 533-549 (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Hopf algebras and topological recursion. (English) Zbl 1452.81115

Liu, Chiu-Chu Melissa (ed.) et al., Topological recursion and its influence in analysis, geometry, and topology. 2016 AMS von Neumann symposium on topological recursion and its influence in analysis, geometry, and topology, Charlotte, NC, USA, July 4–8, 2016. Providence, RI: American Mathematical Society (AMS). Proc. Symp. Pure Math. 100, 333-357 (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Group, graphs, algorithms: the graph isomorphism problem. (English) Zbl 1490.68116

Sirakov, Boyan (ed.) et al., Proceedings of the international congress of mathematicians 2018, ICM 2018, Rio de Janeiro, Brazil, August 1–9, 2018. Volume IV. Invited lectures. Hackensack, NJ: World Scientific; Rio de Janeiro: Sociedade Brasileira de Matemática (SBM). 3319-3336 (2018).
PDFBibTeX XMLCite
Full Text: DOI Link

Complexity problems in enumerative combinatorics. (English) Zbl 1448.05006

Sirakov, Boyan (ed.) et al., Proceedings of the international congress of mathematicians 2018, ICM 2018, Rio de Janeiro, Brazil, August 1–9, 2018. Volume IV. Invited lectures. Hackensack, NJ: World Scientific; Rio de Janeiro: Sociedade Brasileira de Matemática (SBM). 3153-3180 (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Embedding graphs into two-dimensional simplicial complexes. (English) Zbl 1489.68187

Speckmann, Bettina (ed.) et al., 34th international symposium on computational geometry, SoCG 2018, June 11–14, 2018, Budapest, Hungary. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 99, Article 27, 14 p. (2018).
MSC:  68R10 55U10 68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Solving the Rubik’s Cube optimally is NP-complete. (English) Zbl 1487.68121

Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 96, Article 24, 13 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Efficient algorithms for computing a minimal homology basis. (English) Zbl 1485.68320

Bender, Michael A. (ed.) et al., Latin 2018: theoretical informatics. 13th Latin American symposium, Buenos Aires, Argentina, April 16–19, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10807, 376-398 (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Integrable 3D statistical models on six-valent graphs. (English. Russian original) Zbl 1434.82018

Proc. Steklov Inst. Math. 302, 198-216 (2018); translation from Tr. Mat. Inst. Steklova 302, 214-233 (2018).
PDFBibTeX XMLCite
Full Text: DOI

Indecomposable supercharacters of the infinite unitriangular group. (English) Zbl 1512.20021

André, Carlos (ed.) et al., Operator theory, operator algebras, and matrix theory. Based on the presentations at the international workshop on operator theory and operator algebras, WOAT 2016, Lisbon, Portugal, July 5–8, 2016. Cham: Birkhäuser. Oper. Theory: Adv. Appl. 267, 1-24 (2018).
PDFBibTeX XMLCite
Full Text: DOI

Holiest minimum-cost paths and flows in surface graphs. (English) Zbl 1428.68322

Diakonikolas, Ilias (ed.) et al., Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC ’18, Los Angeles, CA, USA, June 25–29, 2018. New York, NY: Association for Computing Machinery (ACM). 1319-1332 (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Visualizing the template of a chaotic attractor. (English) Zbl 1519.68320

Biedl, Therese (ed.) et al., Graph drawing and network visualization. 26th international symposium, GD 2018, Barcelona, Spain, September 26–28, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11282, 106-119 (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Topological complexity of graphic arrangements. (English) Zbl 1385.52018

Grant, Mark (ed.) et al., Topological complexity and related topics. Mini-workshop on topological complexity and related topics, Mathematisches Forschungsinstitut Oberwolfach, Oberwolfach, Germany, February 28 – March 5, 2016. Proceedings. Providence, RI: American Mathematical Society (AMS) (ISBN 978-1-4704-3436-6/pbk; 978-1-4704-4405-1/ebook). Contemporary Mathematics 702, 121-132 (2018).
PDFBibTeX XMLCite
Full Text: DOI Link

Persistent path homology of directed networks. (English) Zbl 1403.68154

Czumaj, Artur (ed.), Proceedings of the 29th annual ACM-SIAM symposium on discrete algorithms, SODA 2018, New Orleans, LA, USA, January 7–10, 2018. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-61197-503-1/ebook). 1152-1169 (2018).
MSC:  68R10 55N35 68U05
PDFBibTeX XMLCite
Full Text: arXiv Link

Topological complexity and related topics. Mini-workshop on topological complexity and related topics, Mathematisches Forschungsinstitut Oberwolfach, Oberwolfach, Germany, February 28 – March 5, 2016. Proceedings. (English) Zbl 1384.55001

Contemporary Mathematics 702. Providence, RI: American Mathematical Society (AMS) (ISBN 978-1-4704-3436-6/pbk; 978-1-4704-4405-1/ebook). vii, 176 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Serial

all top 3

Main Field

all top 3

Software