Thrackles: An Improved Upper Bound

DOI10.1007/978-3-319-73915-1_14zbMath1499.05424arXiv1708.08037OpenAlexW2953795633MaRDI QIDQ4625109

János Pach, Radoslav Fulek

Publication date: 20 February 2019

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.08037

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient computation outsourcing for inverting a class of homomorphic functions
• A hierarchy of polynomial time lattice basis reduction algorithms
• Factoring polynomials with rational coefficients
• Blockchain-based two-party fair contract signing scheme
• Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures
• New Algorithms for Secure Outsourcing of Modular Exponentiations
• Finding a Small Root of a Univariate Modular Equation
• Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
• LLL reducing with the most significant bits
• An Efficient LLL Gram Using Buffered Transformations
• Trapdoors for hard lattices and new cryptographic constructions
• Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
• Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation
• Floating-Point LLL Revisited
• Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences
• Theory of Cryptography
• Algorithmic Number Theory

This page was built for publication: Thrackles: An Improved Upper Bound