Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Longest ``Separated Paths and Loops in an N Cube

From MaRDI portal
Publication:5329394
Jump to:navigation, search

DOI10.1109/PGEC.1965.264259zbMath0125.07807OpenAlexW1981962484MaRDI QIDQ5329394

Earl E. Gose

Publication date: 1965

Published in: IEEE Transactions on Electronic Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/pgec.1965.264259


zbMATH Keywords

numerical analysis



Related Items (2)

A new lower bound for snake-in-the-box codes ⋮ Exhaustive search for snake-in-the-box codes






This page was built for publication: Longest ``Separated Paths and Loops in an N Cube

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5329394&oldid=20011427"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 23:03.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki