Skip to main content

Timeline for Enumerate rhyme schemes

Current License: CC BY-SA 3.0

18 events
when toggle format what by license comment
Apr 13, 2017 at 12:39 history edited CommunityBot
replaced http://codegolf.stackexchange.com/ with https://codegolf.stackexchange.com/
Jan 26, 2017 at 18:44 history edited miles
The number of rhyme schemes is equal to the Bell number which is the number of partitions of a set.
Feb 15, 2016 at 20:11 answer added Martin Ender timeline score: 0
Feb 15, 2016 at 19:42 vote accept Martin Ender
S Feb 15, 2016 at 19:42 history bounty ended Martin Ender
S Feb 15, 2016 at 19:42 history notice removed Martin Ender
Feb 14, 2016 at 12:20 answer added CJ Dennis timeline score: 3
Feb 12, 2016 at 21:07 answer added Jeto timeline score: 2
Feb 12, 2016 at 8:37 answer added CJ Dennis timeline score: 4
Feb 10, 2016 at 5:06 answer added Anders Kaseorg timeline score: 11
Feb 10, 2016 at 3:24 comment added Anders Kaseorg B(26) is the smallest Bell number that doesn’t fit in a 64-bit integer. Meanie. :-(
Feb 8, 2016 at 13:06 comment added Martin Ender Although the bounty is up for polynomial time solutions, I'd still like to see exponential-time solutions that meet the time limit. (My own Mathematica reference implementation would currently still win the challenge.)
S Feb 8, 2016 at 13:05 history bounty started Martin Ender
S Feb 8, 2016 at 13:05 history notice added Martin Ender Draw attention
Feb 5, 2016 at 0:57 answer added feersum timeline score: 13
Feb 4, 2016 at 4:07 history tweeted twitter.com/StackCodeGolf/status/695096346529906690
Feb 3, 2016 at 18:49 comment added Martin Ender I might put a bounty on a (well-golfed) polynomial-time solution (in N), provided that doesn't turn out to be fairly trivial and I was just too stupid to find it.
Feb 3, 2016 at 18:42 history asked Martin Ender CC BY-SA 3.0