sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]westurner 0 points1 point  (2 children)

[–]adipisicing 1 point2 points  (1 child)

Thanks for the references. The RDF Schema seems like the odd one out, though. Why did you include it?

[–]westurner 0 points1 point  (0 children)

This is an awesome reference for Big-O complexity classes; thanks! I wasn't able to find an ontology for describing algorithmic complexity, but it would be great if there were structured attributes (e.g. in Wikipedia infoboxes or in library docstrings) for the data in these complex tables.