Harnessing parallel disks to solve Rubik's cube (Q1025396): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: TOP-C / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jsc.2008.04.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2148043942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3727905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5301676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5301687 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Twenty-two moves suffice for Rubik's Cube\(^{\circledR }\) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:07, 1 July 2024

scientific article
Language Label Description Also known as
English
Harnessing parallel disks to solve Rubik's cube
scientific article

    Statements

    Harnessing parallel disks to solve Rubik's cube (English)
    0 references
    0 references
    0 references
    18 June 2009
    0 references
    0 references
    Rubik's cube
    0 references
    permutation groups
    0 references
    cosets
    0 references
    fast multiplication
    0 references
    disk-based computation
    0 references
    parallel computation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references