If you can enumerate the language of possible inputs you could
generate a unique binary representation. Against a language of size
l that would only take you O(l*n) to build the repr for a dict
and for certain repr sizes the comparison could be O(1), making
the entire operation O(l*n+l*m) vs O(n
Aaagh! Did it without thinking. Should be O(S*N) and O(S*2N).
On Sep 28, 2009 12:09 PM, "geremy condra" wrote:
On Mon, Sep 28, 2009 at 9:53 AM, John Posner wrote: >
> >> If you can enumera...
1) I honestly wouldn't know, seeing as how I wasn't alive ;).
2) After a brief tube hunt, I found tha
On Mon, Sep 28, 2009 at 9:53 AM, John Posner wrote:
>
> If you can enumerate the language of possible inputs you could
>> generate a unique binary representation. Against a language of size
>> l that would only take you O(l*n) to build the repr for a dict
>> and for certain repr sizes the compari
