arXiv (OAI Expanded)
open access
Directed Hamiltonian-Cycle Parity in $O^*((3/2)^n)$ Deterministic Time and Polynomial Space
We give a deterministic algorithm that computes the parity of the number of Hamiltonian cycles in an $n$-vertex directed graph in $O(n^4(3/2)^n)$ time and $O(n^2)$ bits of working space, improving the $O^*(φ^n)$ bound of Björklund and Husfeldt. Their local-degree formula reduces the problem to a wei
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
- Intersection Exponents of Simple Random Walks in Two and Three Dimensions#1061873
- Characterization of graphs attaining the maximum signless Laplacian spectral radius under forbidden cycles and theta graphs#1123541
- Universal Exponent-Two Degree Laws in Range-Renewal Networks#972226
- Spectral Gap of Down-Up Walks via Trickle-Down: A Simplified and Sharpened Analysis#1014108
- The discrete homotopy hypothesis for directed graphs#999233
Record · ID 1149444
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