Talk:FO (complexity)
Add topic | This redirect does not require a rating on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||||||||||||
| |||||||||||||||||||||||||
Number of articles
[edit]I'm not sure FO, SO and "descriptive complexity" need to be 3 articles, since DC is mainly FO and SO. Do you know how to decide if they should be merged in one. Else there is also another possibility: to create one article by operators (the descriptive complexity use of those operators) to give more details about the proof of the facts I stated. Can someone tell me what he thinks of it ? Arthur MILCHIOR (talk) 10:45, 8 June 2010 (UTC)
Copy edit not needed
[edit]It was tagged for {{copy edit}}, but I found the English as such to be fine. I don't believe an article about a subject like this can be made any less technical, either. However, I suspect that the sentence "Usually the input is either a string (of bits or over an alphabet) the elements of which are positions of the string, or a graph of which the elements are vertices." is nonsense (a string whose elements are positions in the string?!). So I've placed an {{Expert-subject}} tag in its place. --Stfg (talk) 13:26, 12 January 2012 (UTC)