arXiv (All)
open access
Asteroidal Triples and Friends in (Likely Necessary) Matrix Multiplication Time
In a seminal paper, Kratsch and Spinrad [SODA 2003 and SIAM Journal on Computing 2006] studied several important problems in structural graph theory that anticipated two trends in fine-grained complexity, both from the upper- and lower-bound side: * From the upper-bound side, for each of these pro
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Certified computations on no-three-in-line problems: exact values and witnesses in the cube, and the Guy-Kelly count in the plane#1051626
- Graph Theory: Fundamental and Applications in Mathematics#119203
- Strengthened upper bound on the third eigenvalue of graphs#1141400
- Graph Homomorphisms and Universal Algebra#1109003
- More Mathematical Puzzles of Sam Loyd#1331436
Record · ID 1357788
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive