Figures from this paper
One Citation
The Complexity of Iterated Reversible Computation
- Computer Science, MathematicsArXiv
- 2021
The definition of IB is robust against variations in the type of reduction used in its definition, and in whether it requires f to have a polynomial-time inverse or to be computible by a reversible logic circuit.
References
SHOWING 1-7 OF 7 REFERENCES
The Complexity of Finding a Second Hmiltonian Cycle in Cubic Graphs
- MathematicsJ. Comput. Syst. Sci.
- 1999
An exponential lower bound is proved on the number of steps of Thomason's algorithm, which is an algorithm that given one Hamiltonian cycle in such a graph, computes another one.
Thomason's algorithm for finding a second hamiltonian circuit through a given edge in a cubic graph is exponential on Krawczyk's graphs
- MathematicsDiscret. Math.
- 2001
THE COMPLEXITY OF THOMASON’S ALGORITHM FOR FINDING A SECOND HAMILTONIAN CYCLE
- MathematicsBulletin of the Australian Mathematical Society
- 2018
By Smith’s theorem, if a cubic graph has a Hamiltonian cycle, then it has a second Hamiltonian cycle. Thomason [‘Hamilton cycles and uniquely edge-colourable graphs’, Ann. Discrete Math. 3 (1978),…
The Traveling Salesman Problem for Cubic Graphs
- Computer Science, MathematicsJ. Graph Algorithms Appl.
- 2007
The algorithm can find the minimum weight Hamiltonian cycle (traveling salesman problem), in the same time bound, and count the number of Hamiltonian cycles in time \(\mathcal{O}(2^{3n/8}n^{\mathcal O}(1)}) \approx {\rm 1.29684}^n\).
Analytic Combinatorics
- Mathematics
- 2009
This text can be used as the basis for an advanced undergraduate or a graduate course on the subject, or for self-study, and is certain to become the definitive reference on the topic.