An Inquiry into Algorithmic Complexity
This is the first section in a proposed monograph on algorithmic complexity theory. Future sections shall include: information Theory as a Proof Technique; Algorithms Using Linear Form Inequalities; Some Probabilistic Analyses of Algorithms, etc. Comments, suggestions and corrections are welc...
| Main Author: | |
|---|---|
| Language: | en_US |
| Published: |
2004
|
| Online Access: | http://hdl.handle.net/1721.1/6193 |
| _version_ | 1811079320210243584 |
|---|---|
| author | ONeil, Patrick E. |
| author_facet | ONeil, Patrick E. |
| author_sort | ONeil, Patrick E. |
| collection | MIT |
| description | This is the first section in a proposed monograph on algorithmic complexity theory. Future sections shall include: information Theory as a Proof Technique; Algorithms Using Linear Form Inequalities; Some Probabilistic Analyses of Algorithms, etc. Comments, suggestions and corrections are welcomed. Please let me know what you think. This is not a limited distribution document, although I may wish to publish it later. Anyone who develops an idea based on this work to a more advanced state is welcome to publish first. I would be very eager to see any such result as soon as possible. |
| first_indexed | 2024-09-23T11:13:20Z |
| id | mit-1721.1/6193 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T11:13:20Z |
| publishDate | 2004 |
| record_format | dspace |
| spelling | mit-1721.1/61932019-04-12T08:29:29Z An Inquiry into Algorithmic Complexity ONeil, Patrick E. This is the first section in a proposed monograph on algorithmic complexity theory. Future sections shall include: information Theory as a Proof Technique; Algorithms Using Linear Form Inequalities; Some Probabilistic Analyses of Algorithms, etc. Comments, suggestions and corrections are welcomed. Please let me know what you think. This is not a limited distribution document, although I may wish to publish it later. Anyone who develops an idea based on this work to a more advanced state is welcome to publish first. I would be very eager to see any such result as soon as possible. 2004-10-04T14:45:21Z 2004-10-04T14:45:21Z 1971-09-01 AIM-237 http://hdl.handle.net/1721.1/6193 en_US AIM-237 7489493 bytes 728875 bytes application/postscript application/pdf application/postscript application/pdf |
| spellingShingle | ONeil, Patrick E. An Inquiry into Algorithmic Complexity |
| title | An Inquiry into Algorithmic Complexity |
| title_full | An Inquiry into Algorithmic Complexity |
| title_fullStr | An Inquiry into Algorithmic Complexity |
| title_full_unstemmed | An Inquiry into Algorithmic Complexity |
| title_short | An Inquiry into Algorithmic Complexity |
| title_sort | inquiry into algorithmic complexity |
| url | http://hdl.handle.net/1721.1/6193 |
| work_keys_str_mv | AT oneilpatricke aninquiryintoalgorithmiccomplexity AT oneilpatricke inquiryintoalgorithmiccomplexity |