Discrete Computation: Theory and Open Problems
Complexity 1. Borodin, A. Computational Complexity: Theory and Practice, in Currents in the Theory of Computing, A. Aho, ed., Prentice-Hall, Englewood Cliff, N.J., 1973,pp.32-89.
| Main Author: | |
|---|---|
| Published: |
2023
|
| Online Access: | https://hdl.handle.net/1721.1/148868 |
| _version_ | 1811086887672086528 |
|---|---|
| author | Meyer, Albert R. |
| author_facet | Meyer, Albert R. |
| author_sort | Meyer, Albert R. |
| collection | MIT |
| description | Complexity 1. Borodin, A. Computational Complexity: Theory and Practice, in Currents in the Theory of Computing, A. Aho, ed., Prentice-Hall, Englewood Cliff, N.J., 1973,pp.32-89. |
| first_indexed | 2024-09-23T13:36:26Z |
| id | mit-1721.1/148868 |
| institution | Massachusetts Institute of Technology |
| last_indexed | 2024-09-23T13:36:26Z |
| publishDate | 2023 |
| record_format | dspace |
| spelling | mit-1721.1/1488682023-03-30T03:37:13Z Discrete Computation: Theory and Open Problems Meyer, Albert R. Complexity 1. Borodin, A. Computational Complexity: Theory and Practice, in Currents in the Theory of Computing, A. Aho, ed., Prentice-Hall, Englewood Cliff, N.J., 1973,pp.32-89. 2023-03-29T14:03:39Z 2023-03-29T14:03:39Z 1974-01 https://hdl.handle.net/1721.1/148868 09585291 MIT-LCS-TM-039 MAC-TM-039 application/pdf |
| spellingShingle | Meyer, Albert R. Discrete Computation: Theory and Open Problems |
| title | Discrete Computation: Theory and Open Problems |
| title_full | Discrete Computation: Theory and Open Problems |
| title_fullStr | Discrete Computation: Theory and Open Problems |
| title_full_unstemmed | Discrete Computation: Theory and Open Problems |
| title_short | Discrete Computation: Theory and Open Problems |
| title_sort | discrete computation theory and open problems |
| url | https://hdl.handle.net/1721.1/148868 |
| work_keys_str_mv | AT meyeralbertr discretecomputationtheoryandopenproblems |