Timeline for Complexity of bitwise AND operation on bit string regular expressions
Current License: CC BY-SA 3.0
22 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 9, 2014 at 1:51 | comment | added | Steven Stadnicki | The exponentiation notation is actually fairly standard for marking a string concatenation operation, so I've edited this post to use it; feel free to edit back if you think it's inappropriate here. (Also, if this is the John Jenkins I know: Hi, John! :-) ) | |
| May 9, 2014 at 1:50 | history | edited | Steven Stadnicki | CC BY-SA 3.0 |
Notation tweak
|
| May 9, 2014 at 1:11 | answer | added | D.W.♦ | timeline score: 1 | |
| May 8, 2014 at 20:28 | comment | added | vzn | think there is some fairly natural recursive algorithm for this based on the groupings, ie one grouping as a parameter to a function... | |
| S May 8, 2014 at 8:21 | history | suggested | John Jenkins | CC BY-SA 3.0 |
Fixed space big-O estimation.
|
| May 8, 2014 at 8:14 | review | Suggested edits | |||
| S May 8, 2014 at 8:21 | |||||
| May 8, 2014 at 7:03 | review | Suggested edits | |||
| May 8, 2014 at 8:03 | |||||
| S May 8, 2014 at 6:48 | history | suggested | John Jenkins | CC BY-SA 3.0 |
Added additional ideas for a possible answer to question related to comments made.
|
| May 8, 2014 at 3:15 | review | Suggested edits | |||
| S May 8, 2014 at 6:48 | |||||
| May 8, 2014 at 1:54 | comment | added | Yuval Filmus | Do you expect the size of the solution to be always polynomial in the size of the input? This is not clear. If the output could be much larger, it would still make sense to ask for an algorithm whose running time is polynomial in the output size. | |
| May 8, 2014 at 1:44 | comment | added | Yuval Filmus | I would hardly call these regular expressions. These are words where you are allowed to use the exponentiation operator. Calculating the AND of two bona fide regular expressions can be done by converting to NFA and back. | |
| May 8, 2014 at 0:48 | history | tweeted | twitter.com/#!/StackCompSci/status/464205272727429120 | ||
| May 8, 2014 at 0:43 | history | edited | John Jenkins | CC BY-SA 3.0 |
added 278 characters in body
|
| May 8, 2014 at 0:22 | history | edited | John Jenkins | CC BY-SA 3.0 |
added 265 characters in body
|
| May 7, 2014 at 23:08 | history | edited | Raphael | CC BY-SA 3.0 |
added 6 characters in body; edited tags
|
| May 7, 2014 at 22:49 | history | edited | John Jenkins | CC BY-SA 3.0 |
edited title
|
| May 7, 2014 at 22:39 | history | edited | John Jenkins | CC BY-SA 3.0 |
deleted 2 characters in body
|
| May 7, 2014 at 22:33 | history | edited | John Jenkins | CC BY-SA 3.0 |
deleted 5 characters in body
|
| May 7, 2014 at 22:28 | review | First posts | |||
| May 7, 2014 at 22:57 | |||||
| May 7, 2014 at 22:26 | history | edited | John Jenkins | CC BY-SA 3.0 |
deleted 5 characters in body
|
| May 7, 2014 at 22:17 | history | edited | John Jenkins | CC BY-SA 3.0 |
edited body
|
| May 7, 2014 at 22:10 | history | asked | John Jenkins | CC BY-SA 3.0 |