Skip to main content
24 events
when toggle format what by license comment
Feb 22, 2023 at 13:42 answer added winitzki timeline score: 1
S Jun 16, 2020 at 13:40 history suggested auspicious99
added a tag
Jun 16, 2020 at 7:15 review Suggested edits
S Jun 16, 2020 at 13:40
Mar 19, 2019 at 22:40 answer added xrq timeline score: 2
Mar 18, 2019 at 21:34 answer added Slimane Oulad-Naoui timeline score: 2
Dec 27, 2015 at 4:02 answer added Pratyush Mishra timeline score: 8
Sep 25, 2012 at 21:13 comment added vzn see also Applications of representation theory of the symmetric group
May 6, 2012 at 19:44 answer added Alan Guo timeline score: 13
Apr 2, 2012 at 15:02 answer added Sasho Nikolov timeline score: 14
Apr 2, 2012 at 14:55 vote accept GEL
Apr 2, 2012 at 1:55 answer added Vijay D timeline score: 13
Mar 31, 2012 at 16:06 answer added András Salamon timeline score: 12
Mar 31, 2012 at 9:43 answer added Uday Reddy timeline score: 56
Mar 31, 2012 at 9:36 answer added Jeffε timeline score: 15
Mar 31, 2012 at 6:16 history edited Kaveh
edited tags
Mar 31, 2012 at 2:40 history tweeted twitter.com/#!/StackCSTheory/status/185919343194935297
Mar 30, 2012 at 23:57 answer added David Lewis timeline score: 6
Mar 30, 2012 at 23:28 answer added Aaron Roth timeline score: 15
Mar 30, 2012 at 22:55 answer added Dai Le timeline score: 29
Mar 30, 2012 at 21:36 comment added v s Possibly anything that can be representable has an use in Computer Science!
Mar 30, 2012 at 21:31 answer added Shitikanth timeline score: 6
Mar 30, 2012 at 21:15 history edited GEL CC BY-SA 3.0
added 45 characters in body; edited title
Mar 30, 2012 at 21:02 comment added Suresh Venkat This seems rather vast. All kinds of algebraic structures (groups, rings, semirings, semigroups, fields) show up in theoretical computer science, and it's pervasive enough that you'd be hard pressed to find a specific subcomponent. Also, don't forget finite fields for hashing and many other randomized fingerprinting methods.
Mar 30, 2012 at 20:02 history asked GEL CC BY-SA 3.0