[{"run_id":"20260906T231458-5fdd2fff","semester":"1272","observed_at":"2026-09-06 23:14:58.172943+00:00","record_version_id":"b158817a596921377214f4caefe624d6ac269e1b1e0eed09ceff34789d6b251a","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"20260907T155543-ce3781c4","semester":"1272","observed_at":"2026-09-07 15:55:43.033547+00:00","record_version_id":"b158817a596921377214f4caefe624d6ac269e1b1e0eed09ceff34789d6b251a","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-03b0bbb9723907cf3d1b41cf0bb34837dc398e42","semester":"1262","observed_at":"2025-04-16 05:20:33.104844+00:00","record_version_id":"ba843254335a856b64a40e58a01c7f9a11eabe28ba47e980053e742eea899e28","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-0837245627eb714ae6bb0375f7abe8f41042011f","semester":"1262","observed_at":"2025-04-16 05:20:33.104844+00:00","record_version_id":"ba843254335a856b64a40e58a01c7f9a11eabe28ba47e980053e742eea899e28","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-08c92e359bbbc110b0778b7e0b15d6f40000e6b1","semester":"1262","observed_at":"2025-08-21 07:05:14.730696+00:00","record_version_id":"833ac6315622980f44faf6778d05c3b33b749054c4c711f9f4b49d9a72f6536b","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-0944d76440dc778fbb89626058c10451009ce9c6","semester":"1262","observed_at":"2025-05-21 03:36:18.194118+00:00","record_version_id":"23070bb8ecd7e0831ed169a2121c1d77a9b36ced2afea2515cba94dfbb94a1e9","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-0a7f4bce29c816ef4d3d71b4eb8a2a3e15e33cc1","semester":"1262","observed_at":"2025-06-18 20:04:02.695444+00:00","record_version_id":"535888f8ba9d1bac841ab1f839adb6646bfa9adb41dd308d337336dd05da75c6","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-0ab917f827a7de22ebdc1087114d377a31c4687b","semester":"1262","observed_at":"2025-05-22 02:11:02.531191+00:00","record_version_id":"f1f52d9490f26d1be1a44d92995ed223dd883259f7f9e2d6aaec21f7fb52e988","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-0c40ecab4b6db9333d1f18aef816e3ee659e300c","semester":"1262","observed_at":"2025-05-25 18:02:34.797617+00:00","record_version_id":"6f6c4e8a1eacdff81301e58cb9605b321ecf7f1a5e82792a0e77aed24ebfe219","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-0cb4d29a588ec7f11c7e00b7cf5dc3a0d23d0349","semester":"1266","observed_at":"2026-01-22 01:00:26.555427+00:00","record_version_id":"ba4d33712d4925c6ae8f6641014f3498a8f9284cd7df5e06b7b2fb9ccd9127bb","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-11c30ec39e91498cbfcf3a923c53a4b03e387280","semester":"1262","observed_at":"2025-07-20 04:58:26.847117+00:00","record_version_id":"792368ffba2cd27e7de8c12a24b7f1f74101e5c003617ec5f1526221505b58bb","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-13cd500edf2587e9a3428f326253738fbea965ea","semester":"1264","observed_at":"2025-12-14 04:50:04.653658+00:00","record_version_id":"ddb3c91332c2dea38f247f7898533c6ed577100bc053cd9e7ae9c7b5bae85956","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-1da08b2de39f05e6bc877c189fc2fd6eeda563f5","semester":"1262","observed_at":"2025-07-01 00:03:56.707251+00:00","record_version_id":"932c33778ae87c7b597f4919cb64770076356cfaaf38b3ee28723d0dd66646ce","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-2031af47efe133b0e7877f433286ff07385afc41","semester":"1262","observed_at":"2025-07-02 20:16:45.749584+00:00","record_version_id":"26877971f1b1a7064ff4f4a8525c4d6147af541e93164c136b33eb51412ea568","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-238eba6f32fbc30407f616dd0628ff02a2a824dd","semester":"1262","observed_at":"2025-08-17 05:15:07.788352+00:00","record_version_id":"d6e1227703f3bb8d662a6e3c92ec307db0760bcba01f2f99a9d7a645ebb6b3f3","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-25f0ff56bc4d80f8a8afa1a0bcce8dae6fddb5e5","semester":"1262","observed_at":"2025-05-25 17:20:25.942090+00:00","record_version_id":"53c3368a4312da73dd233e3258c49b9a938f4480ee84d32aa067547130e4a595","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-2923f91826ce253b7aeefa9f75b4a39fe4c80ff0","semester":"1262","observed_at":"2025-08-10 05:10:25.938416+00:00","record_version_id":"a2ea723272c2d59d21cd8e1155802228064fb5e88aa928c953ab276f38a8bf3a","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-2a05214a4023e0157fa6f7d188c85308f714176c","semester":"1262","observed_at":"2025-09-07 04:56:38.255315+00:00","record_version_id":"3029725611fa13668614e383b5bf96252971d1b3bdc1115ccf11e8532cf552a4","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-2b1b8e39131de92b94620b25c5bbb25690efed4c","semester":"1262","observed_at":"2025-06-01 07:54:53.913454+00:00","record_version_id":"747151372e34d92c9bb9d56fc2753d561b5465b0dc05d453a7628766e355ab7c","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-33a1225644e5a5855d60f66e65413946e72fedf4","semester":"1262","observed_at":"2025-06-22 01:52:05.152650+00:00","record_version_id":"157486d13a9786be3f195826a56cc8d667841915e16c93d633802a8a85f4156c","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-3b89c83dbf5208e13756184de1f2b2d0c09af35f","semester":"1262","observed_at":"2025-06-30 06:40:10.235522+00:00","record_version_id":"f2126b1a9b0fbd38705117f83882adbd17b19a78e149ae036505c9513633d1ad","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-3c3eebf7f35c39364b445a2fa5a112ce28dbb4a1","semester":"1262","observed_at":"2025-06-01 17:03:59.062985+00:00","record_version_id":"14d86dd0380f0225713ec82461d8d6ae6ae15a17ec584e98728f7b0c64b98db4","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-3fa4dd71391f1c9cf4ab2216680bbc428689f92d","semester":"1262","observed_at":"2025-05-25 01:15:58.180530+00:00","record_version_id":"1a8b5b7814688a0e86135b22388f96a069364e54d06b0988f5cd3df4fd24a636","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-4040aa216da722a34483f68fc1e129ea571ae08d","semester":"1262","observed_at":"2025-06-01 07:27:39.695506+00:00","record_version_id":"34508bd3eed257344fd8228d65dffc6a8aaf54f76d87015301ba802ffa4837ac","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-454d53cd690294459f8ad0793cc3ed562060e56c","semester":"1262","observed_at":"2025-05-25 01:34:00.536004+00:00","record_version_id":"cc78c2efb81cdad5eeca436555f1a5b23cfcc64e3cd2d09513f78096382bfd51","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-486f091e051fdb4ccdb80ee7b4fb0a5814510324","semester":"1264","observed_at":"2025-11-16 05:32:31.273726+00:00","record_version_id":"f4ac8e5ea1f32ac00e6161ac7bfecfd9a88fac9b77d48142541397a2fa082c8a","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-50393cfc5fd5598d4f4731ef1919f2ff53af07d9","semester":"1262","observed_at":"2025-06-30 06:05:57.438846+00:00","record_version_id":"09313b4f013fb163405792beaeb995ba4cc9e97a6fd37c83c27144ec883d49d6","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-50f6947786b208c800db8bbd0cec84a8f0f187d2","semester":"1262","observed_at":"2025-06-02 03:49:42.915428+00:00","record_version_id":"9587397b7f55a3d7e65ee2c4aebd1b6b33941e8c06712327c2ab51191f967362","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-51d86ed4082dced3803c295419b0ec8440942016","semester":"1264","observed_at":"2025-11-12 04:50:41.141307+00:00","record_version_id":"e1de4d55e825fa134cc770a2fe66edc5ea311ebf136de4d1be92f910c6caad15","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-53101bd1c10db0d00d094e4c9154d4c244ff23d9","semester":"1262","observed_at":"2025-10-05 04:58:05.366968+00:00","record_version_id":"bf08616d80b707112b2ec7295c754cb017fc2b8a16eba109e6017bff4e6a40f6","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-58751151c564e11c5cb8aedd3a2d3527c22f73eb","semester":"1262","observed_at":"2025-06-01 06:59:01.536576+00:00","record_version_id":"977507d0e325b8618bdf717c6d899e861787b99feab61c5e87466e7ef6d3cd06","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-5c4c8d3701a333ba4ddadef7d0b5dde8440fcdf0","semester":"1262","observed_at":"2025-06-01 01:57:51.256704+00:00","record_version_id":"a33a254f7948abcb69c48b5f2f61bbcb7459be4753f5b3dd458579a551e0d830","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-5d20d9f81651d3c83fcaa2fd10870ce6e5d5a685","semester":"1262","observed_at":"2025-05-21 16:48:48.484741+00:00","record_version_id":"8822a0efeb445e4734db8263b1743cb27466f65f2fdf26ba97b3adc6e65b39a3","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-5feaebf2ab37051c86ad360cc0fa0d7e0e2ea295","semester":"1262","observed_at":"2025-05-24 15:58:23.378859+00:00","record_version_id":"1aed41af2621f6a19cb87a4b7260b68a051ed5e4973402b62a939fd01ef9a591","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-60949965544fce098cc006354e201149005fb77b","semester":"1264","observed_at":"2025-10-26 05:07:14.077864+00:00","record_version_id":"364d8c75a1c39acc54948d43dde284d81f09dcc029b778a3672d7b010db9f548","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-639225ac3addf8522f1d30cb4fe26054ea7f8c49","semester":"1262","observed_at":"2025-06-01 08:14:42.497608+00:00","record_version_id":"157486d13a9786be3f195826a56cc8d667841915e16c93d633802a8a85f4156c","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-64093b17b3a9c67a41aa33eb37adb53ec38df714","semester":"1262","observed_at":"2025-05-22 02:11:02.531191+00:00","record_version_id":"4a6b0d0f6ba78046182d496f45769942886cfd6927560427aecabdc15c305eb5","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-6885b56099f55e08aa0205546369fb0381d50e13","semester":"1262","observed_at":"2025-07-13 04:59:22.367394+00:00","record_version_id":"245a80001935860c62c9006e7fc0e28239d1f3e8990f3dbb54adcf937e15fd5c","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-69d4b2b16e8268f75b6390b3a0e2ce8bf73999da","semester":"1262","observed_at":"2025-06-30 03:21:29.925498+00:00","record_version_id":"6da16c54b6087d5e61d8499bc8a91a55516a21dbbe0c2513717749db2e1c2d9f","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-6b29c3e0673b2f9a736d2363db5409e03d5b3ed4","semester":"1264","observed_at":"2025-12-03 12:33:41.418072+00:00","record_version_id":"5f93f14492da2abdbf8a332ee93b9492d5b3e818cca6b2e29ecebe5c0508a25d","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-73259984748de484976ef2ad56ad7ab3d4cb4518","semester":"1262","observed_at":"2025-06-26 08:27:56.461216+00:00","record_version_id":"6b6316204ee7c51700da55c48c29a2e5f4b0e8c9a6460b9b84d0f37931ef18cc","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-741602fbc6252c232a0b9e6bc1a9ae3101625f5a","semester":"1262","observed_at":"2025-06-30 22:49:32.522034+00:00","record_version_id":"e944f57ce0e75f7ec1b9dfbdd4f0ff283857d6ca603226ac3764b77ad27a0a8d","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-7774f45558276ec29bf626e58fffb4a27bdbb2a9","semester":"1264","observed_at":"2025-11-01 11:49:36.359151+00:00","record_version_id":"5a470a3e6d947632e5ba50e60938b7465d4651d226c3a1f2c8c844960848b4b8","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-7ab7c5e783fc8ebef8b8ee8cea019ee37a72ce74","semester":"1262","observed_at":"2025-09-28 04:58:07.340658+00:00","record_version_id":"5f54d01bf94947b11f57e8e9f131f6e614553a680ad67e2dd7bc67d85766a9eb","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-7b2f22d83ea05055ab90dcb77dc802382cccc6f7","semester":"1262","observed_at":"2025-05-21 17:56:46.096741+00:00","record_version_id":"4cde5912b43edc597839e7813b9f9e9b731f41a6da457370e5a3cd35286901c3","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-7ca1175502be18eb51f7b016818a884a43fd4ebb","semester":"1262","observed_at":"2025-07-29 06:28:23.644795+00:00","record_version_id":"907226dd56c7dfd85fcee94ef24e60cfc02d6e6be946546eac2f5eaac8aaabcf","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-7d8cee5e42602ad9ba5dc0322085af2fa0dffaac","semester":"1262","observed_at":"2025-05-22 01:15:19.291664+00:00","record_version_id":"1b5824a345841f517be7046f0a04242dc776f110bc09a4e5accebc8be959fe31","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-81a0d6a7f668c98c59bd05fa988aa079c5ad1f68","semester":"1262","observed_at":"2025-05-31 07:49:50.419452+00:00","record_version_id":"f722b67b55406449ae82ea4efe073de38518d709c5b6e8a827f3cfec537df11e","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-82f31c08c746a214872494cde6ecaeb9330441b4","semester":"1262","observed_at":"2025-06-17 21:26:08.547156+00:00","record_version_id":"a33a254f7948abcb69c48b5f2f61bbcb7459be4753f5b3dd458579a551e0d830","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-84c248343c5a99ab42c5616c594812a5e3e31cbb","semester":"1262","observed_at":"2025-07-04 06:00:07.487827+00:00","record_version_id":"4b2b2ef15d8125e3184772fd400ee8191ee52dc5a123dc22f3e45e5c7ada8ed9","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-86334e7275e315853287e8580c35456c68df800b","semester":"1262","observed_at":"2025-05-22 06:53:03.336354+00:00","record_version_id":"78c1a7e02e2a4913a806ae6c91305c1002da88e264610084fd6988c3a44e17b6","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-8686dc1664f93a6c05f50321410961b39b12f91b","semester":"1262","observed_at":"2025-05-28 10:17:41.595894+00:00","record_version_id":"5741592c3c8eb4dcc354a2eac9a4f994772dce77b02ff73cbf74bad3ddbfd2c7","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-86d941366886c9a14a2581c04e20d0bdd25e1b02","semester":"1262","observed_at":"2025-08-31 04:54:14.656039+00:00","record_version_id":"a062f71b0eb96e689de3ad5e9b883c566c73c3c2c1c7795275243c7e9d61b20a","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-8ba1d2e6cfbb1525b4f9f769ec164fb6ad0f237a","semester":"1262","observed_at":"2025-06-02 05:22:45.010398+00:00","record_version_id":"4bced8f0bd9132f3a3e2c5382819d3d0245c996e1afebd8b646d4f85de758ba3","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-90e5aa456689a3b222016c05c319bbcd0bddd453","semester":"1262","observed_at":"2025-05-25 02:00:10.037905+00:00","record_version_id":"ccd75e22c8e47e41bd5de29e487717d1fb69d8bed3546238be4ecedc5edbece1","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-92d960aa7e4cd6e4c9ac8b2e232092904038e9e4","semester":"1262","observed_at":"2025-06-08 01:50:46.451351+00:00","record_version_id":"0aa7a699a457f7e9803c485c65b6659070b24390bad6ccda30547526ec0e7524","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-94002ae588a8f71eca6d64105f2e603e8587293b","semester":"1262","observed_at":"2025-05-21 09:01:16.021508+00:00","record_version_id":"bbd284673640d0e3660349a640b26dc3b9e094586936a200c5d2b1b9bffec8e9","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-9dd575e013c5c6e000ab3ad2d1288cc1dd9c96dc","semester":"1264","observed_at":"2025-12-21 04:47:46.589081+00:00","record_version_id":"cddb6b97f195fcc2dd4172dece32fdbcce95a39925424aa718275b8bd70a1920","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-a1ea26ed78cbd6e94bc3221e50a6ed9b6bf43871","semester":"1262","observed_at":"2025-05-25 09:16:55.180581+00:00","record_version_id":"81f28e7c89b9438d2db6f0c4825fa3d4d53a5b8539c7f10cd2d93559931c3262","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-a76a3505853d5ea9c13bb98472b87361d469e2ee","semester":"1262","observed_at":"2025-05-28 18:03:41.793846+00:00","record_version_id":"626a713fec2c2a245c35a2f4bd45e7b1209e6057a9da84d3525c444c62de3011","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-b285d591f6acf3aa1910e02edc297664db86eb8c","semester":"1262","observed_at":"2025-06-10 22:48:22.460295+00:00","record_version_id":"84e3d9221e0957e02a9b6457421bffd79b7068896dbdef6c9e2a9b2f093d3726","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-b79af756e4f00ba98231feb859ed8e98239eb811","semester":"1262","observed_at":"2025-05-22 02:47:56.931581+00:00","record_version_id":"f337ad6b4c2229c5450ffa2ce67164112650bb0bc3a58cebd8a187110ef1872a","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-b89e05b94730c6471439082d9279c0a834a4aeec","semester":"1262","observed_at":"2025-08-26 20:25:42.325239+00:00","record_version_id":"1f7ed51d768ac4ffe72dea2fafd02ea4eb690a069e0b111b351a7f1e825a449d","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-b9279a12d1f2688df9e556183c94d41a89e431dc","semester":"1262","observed_at":"2025-07-06 01:49:47.203835+00:00","record_version_id":"37500964988f1a02453c2b1e8ca57161d155dfbcf944d1c4d7b698a4a7c4eda2","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-bbdc905e96cc681a5e9a8b02c795b682206e36d1","semester":"1262","observed_at":"2025-06-25 08:02:45.445730+00:00","record_version_id":"f8eb6f9026c739b4d558777dcd69023e64f85c176489425a2ecfa038aa010463","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-bde225b5243a13d81827aa173e39c78a652b54a0","semester":"1262","observed_at":"2025-05-23 07:22:33.219345+00:00","record_version_id":"f4f9c5fabe152f145e857b7036f6741099370558efe90b5b520ab56b20bbbe04","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-c1fac4cbfde737f4f4ac02cdf15e6f5a9b5b676d","semester":"1262","observed_at":"2025-05-22 01:15:19.291664+00:00","record_version_id":"1b5824a345841f517be7046f0a04242dc776f110bc09a4e5accebc8be959fe31","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-c6b62be45f8a13cba109ef2a7741b9cd9a6b8272","semester":"1262","observed_at":"2025-08-24 08:48:09.035112+00:00","record_version_id":"6a52ebc42a59a93d8a60de285d8e35ff4196d4259a5772a210df9d9940ef1119","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-cc83f62cb6db61f39320916d819ad48ce55cd96d","semester":"1262","observed_at":"2025-05-22 00:45:35.735230+00:00","record_version_id":"69b5490512cc50ac7cc8480f9073f098537cd73ec388de51d73ca5c8f980fd4d","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-d33818a01b6b4c5e2902e704da6e5b713742d4dc","semester":"1262","observed_at":"2025-10-13 10:46:24.251475+00:00","record_version_id":"57daa9938286be98114f6bba1797ac2fcd67d219d4dcaa252001d440b046e3b9","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-d3c17db9832d3064916046caf891dd23f10b1bb9","semester":"1262","observed_at":"2025-08-26 11:30:42.288639+00:00","record_version_id":"5a69ea152019ee40e888ac8a53e57cddf2f9be349e371723458daf98157e025d","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-d4ee226dc44268e9b6767fb9f5f20343322f494b","semester":"1262","observed_at":"2025-06-15 01:52:23.911697+00:00","record_version_id":"a226f889331a0c4157746225cdad5e3ed44b4cef110076f335ec7eb63be01734","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-d8f9fc7f136e2033556d9d65bbdbdf33425dbdc9","semester":"1262","observed_at":"2025-05-28 16:48:12.400438+00:00","record_version_id":"93e6d92d97d4db313e7c3031610242ab7473a373f9f862b04eaefa18a36f4c0c","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-dbbc9739c616c3846b2e796e00a36fa41225f7d8","semester":"1262","observed_at":"2025-06-01 17:47:19.325144+00:00","record_version_id":"624848460c270608926c3ceed99fc5f72fe8629df4ec7e4bf710c45c44d14484","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-dbe5f2d24b48c3177297a3d69c553cc9d1194bac","semester":"1262","observed_at":"2025-09-14 05:00:27.366070+00:00","record_version_id":"98277989648b14a8f61263538a24993c69455de04b9cc8b9590229191d9148f4","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-dd357dc2758e9e282c30988a527ce37de92593b9","semester":"1264","observed_at":"2025-10-19 01:39:41.951404+00:00","record_version_id":"9ba0ac69fcb490730a66915d96cca083348708e764998e6821fd5b48bc530e6e","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-de74de559e409a3fe668685e28043b888d2e6841","semester":"1262","observed_at":"2025-06-27 07:38:50.882897+00:00","record_version_id":"6eab4ae3564a51039acd662039886f5fe3071b9ba4d3fb8769b54ba66e67530e","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-deca7188cf536ade3203cd88b52a45e92a059617","semester":"1262","observed_at":"2025-06-27 00:37:46.087071+00:00","record_version_id":"bfbd9bca3447809bd22da67951493ea9c8a8fbf0902b917a8a6fbaa6e336f6b1","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-df60fa9ac3931c5612b0fa641b7a6f5fbec86fab","semester":"1262","observed_at":"2025-05-24 06:36:37.554678+00:00","record_version_id":"aa8b010a38567c6635ee4b5d4b282b466a663174a9eba362094d84a82744d1fd","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-e339da2d849aaf8bb4dceca07a84728af23cf755","semester":"1262","observed_at":"2025-07-23 08:49:22.748925+00:00","record_version_id":"a4f632798f6ec414cdc22263e64689798afb44d40237cc8599ec8544fe1ec0a9","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-e934b1784835f5d36ae9b7ef0992b11e72c39142","semester":"1262","observed_at":"2025-06-01 06:21:25.219533+00:00","record_version_id":"a36c9af0883ab6f899b0a42a50e1c233a97c24b0cfd2573941ccac8f30d36267","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-ef471690c082448deebd2687eab84b0b78813c36","semester":"1262","observed_at":"2025-06-29 01:47:56.317645+00:00","record_version_id":"5312696e65fbc68e884f674ef6b0c05628f3cb3e9ab40f249686b64cb08ee688","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-efc4e8e2cd7c3f68e059a308990c00c77c7611eb","semester":"1264","observed_at":"2025-10-16 05:48:13.935141+00:00","record_version_id":"041d9c6eb571a452b2ad2bf65fe630973843cf49854212a9748a524dfa248f7e","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"},{"run_id":"legacy-f18b7749725097d41f69c60779ff38cf073b93b3","semester":"1262","observed_at":"2025-05-21 19:52:03.259353+00:00","record_version_id":"f92cfcd19759b875cb3436f014102782416df81e5c0bd3aa5f784fb0d5554434","course_id":"COMPSCI 710","course_uid":"course_5aa71f83eb9826ebff756395","catalog_version_id":"ce67a0c04842e83306c8957d25ead19fcc85617f5da1bafe87dd945506005b56","course_number":710,"subjects":["COMPSCI"],"title":"COMPUTATIONAL COMPLEXITY","description":"Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems.  Knowledge of the theory of computation is strongly encouraged, such asCOMP SCI 520.","requirements_text":"Graduate/professional standing"}]