โ Scribed by Traub, J. F.
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract The theory of computational complexity in computer science investigates the time and space resources required to solve a computational problem. We show that an analogous complexity theory can be developed for quantum control problems which do not stem from computational problems. First
The Symposium On The Complexity Of Computer Compu Tations Was Held At The Ibm Thomas J. Watson Research Center In Yorktown Heights, New York, March 20-22, 1972. These Proceedings Contain All Papers Presented At The Symposium Together With A Transcript Of The Concluding Panel Discussion And A Compreh
The Symposium On The Complexity Of Computer Compu Tations Was Held At The Ibm Thomas J. Watson Research Center In Yorktown Heights, New York, March 20-22, 1972. These Proceedings Contain All Papers Presented At The Symposium Together With A Transcript Of The Concluding Panel Discussion And A Compreh
The Symposium On The Complexity Of Computer Compu Tations Was Held At The Ibm Thomas J. Watson Research Center In Yorktown Heights, New York, March 20-22, 1972. These Proceedings Contain All Papers Presented At The Symposium Together With A Transcript Of The Concluding Panel Discussion And A Compreh