Computational Complexity Theory 2 Flashcards
1
Q
Euler diagram of key complexity classes, given P =/= NP
A
2
Q
Euler diagram of key complexity classes if P = NP
A
-TierI Interview Prep (31 decks)
- Hash maps
- B-Trees
- V8
- Stacks
- LinkedLists
- More Sorting
- Locality Optimizations
- External Memory Algorithms
- Queues
- Misc
- Heaps
- Strings
- Computational complexity Theory
- More graph Algos
- OS And Runtime Basics
- Computer architecture
- DDI Ch 3 - Storage & Retrieval
- Hardware Performance
- Algo's
- LEETCODE
- Trees
- Arrays
- JS syntax / functions
- Computational Complexity Theory 2
- Distributed Algorithms
- Sorting
- Sorting - Concurrent
- Hashing - in depth
- Dynamic Programming
- Ddi Ch 3 Images
- -LCB Arrays
