arXiv (All)
open access
A Deterministic $O^*((3/2)^n)$ Algorithm for the Parity of Directed Hamiltonian Cycles
We give a deterministic algorithm for the parity of the number of directed Hamiltonian cycles in an $n$-vertex digraph. For $n\geq 2$, the running time is $O^*((3/2)^n)$ and the space usage is $2^{O(n/\log n)}$. The construction starts from the local-degree identity of Björklund and Husfeldt. Their
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
- A Möbius function computing $h$-polynomials of nestohedra#1109741
- Algorithms and computational complexity in quantum simulation and quantum machine learning / Bernhard Jobst ; Gutachter: Frank Pollmann, Peter Rabl ; Betreuer: Frank Pollmann#1145471
- Near-Optimal Bounds on the Density of Low-Energy States of $k$-Local Hamiltonians and Faster Quantum Algorithms#1128798
- Neutrino thermalization via randomization on a quantum processor#792665
- Neutrino thermalization via randomization on a quantum processor#788665
Record · ID 999965
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