Optimal a-set pair code: Revision history

From Polymath Wiki
Jump to navigationJump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

11 June 2009

  • curprev 12:1812:18, 11 June 2009‎ Teorth talk contribs‎ 10,353 bytes +10,353‎ New page: // Optimally selecting symmetric representatives of subsets of [2]^4 #include <stdio.h> #include <stdlib.h> #include <string.h> #include <time.h> #define NUM_PERMS 384 int perms[NUM_PE...
Retrieved from "https://michaelnielsen.org/polymath/index.php?title=Optimal_a-set_pair_code"