Jump to content

Information for "Superpermutation minimisation"

Basic information

Display titleSuperpermutation minimisation
Default sort keySuperpermutation minimisation
Page length (in bytes)86,006
Namespace ID0
Page ID10413
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page0
Counted as a content pageYes
Number of subpages of this page0 (0 redirects; 0 non-redirects)
Page views in the past month0

Page protection

EditAllow all users (infinite)
MoveAllow all users (infinite)
View the protection log for this page.

Edit history

Page creatorrosettacode>Paddy3118
Date of page creation22:26, 14 November 2014
Latest editorWherrera (talk | contribs)
Date of latest edit23:22, 25 August 2024
Total number of edits75
Recent number of edits (within past 180 days)2
Recent number of distinct authors1

Page properties

Hidden category (1)

This page is a member of a hidden category:

Transcluded templates (11)

Templates used on this page:

SEO properties

Description

Content

Article description: (description)
This attribute controls the content of the description and og:description elements.
A superpermutation of N different characters is a string consisting of an arrangement of multiple copies of those N different characters in which every permutation...
Information from Extension:WikiSEO
Cookies help us deliver our services. By using our services, you agree to our use of cookies.