2012
Oct
17
revised How to show that f(x) is primitive recursive?
edited title
Apr
10
revised Introductory books on nature sciences behind bioinformatics
improved formatting
Mar
15
revised How to verify number with Bob without Eve knowing?
added 410 characters in body
Mar
13
revised Are all context-free and regular languages efficiently decidable?
deleted 18 characters in body; edited tags
Mar
10
revised Is an infinite union of context-free languages always context-free?
rolled back to a previous revision
Mar
10
revised Is an infinite union of context-free languages always context-free?
deleted 131 characters in body; edited tags; edited title
Mar
10
revised Is an infinite union of context-free languages always context-free?
rolled back to a previous revision
Mar
10
revised Is an infinite union of context-free languages always context-free?
deleted 131 characters in body; edited title
Mar
10
revised How to come up with the runtime of algorithms?
added 200 characters in body
Mar
10
revised The time complexity of finding the diameter of a graph
added 19 characters in body
Mar
10
revised The time complexity of finding the diameter of a graph
added 68 characters in body
Mar
10
revised The time complexity of finding the diameter of a graph
added 68 characters in body
Mar
9
revised A sufficient and necessary condition about regularity of a language
edited body
Mar
9
revised A sufficient and necessary condition about regularity of a language
added 141 characters in body
Mar
9
revised A sufficient and necessary condition about regularity of a language
deleted 10 characters in body
Mar
9
revised Is this finite graph problem decidable? What factors make a problem decidable?
added 12 characters in body
Mar
9
revised Is this finite graph problem decidable? What factors make a problem decidable?
edited title