Skip to main content

Timeline for Generalized Gray codes

Current License: CC BY-SA 4.0

17 events
when toggle format what by license comment
May 11, 2018 at 18:43 comment added l4m2 @Anush so how do bit width go?
May 11, 2018 at 18:17 comment added user9207 @l4m2 For the purposes of the complexity analysis assume k goes to infinity.
May 11, 2018 at 18:15 comment added l4m2 How do the complexity work when n and k are limited? assuming they go to infinity with bit width how to go
May 11, 2018 at 14:58 answer added Neil timeline score: 1
May 11, 2018 at 13:28 history tweeted twitter.com/StackCodeGolf/status/994932163136118786
May 10, 2018 at 22:27 answer added JohnWells timeline score: 1
May 10, 2018 at 22:17 answer added recursive timeline score: 2
May 10, 2018 at 19:19 comment added user9207 @user202720 No I didn't intend that.
May 10, 2018 at 17:50 history edited Mr. Xcoder CC BY-SA 4.0
Improved formatting
May 10, 2018 at 17:01 comment added user202729 (should "add or subtract 1" performed modulo I_i+1? Can you reach 0 from I_i?)
May 10, 2018 at 16:43 answer added user202729 timeline score: 4
May 10, 2018 at 16:33 history edited user9207 CC BY-SA 4.0
added 4 characters in body
May 10, 2018 at 16:27 history edited user9207 CC BY-SA 4.0
added 156 characters in body
May 10, 2018 at 16:19 history edited user9207 CC BY-SA 4.0
added 35 characters in body
May 10, 2018 at 16:13 history edited user9207 CC BY-SA 4.0
added 35 characters in body
May 10, 2018 at 16:02 review First posts
May 10, 2018 at 16:08
May 10, 2018 at 16:00 history asked user9207 CC BY-SA 4.0