🎓How I Study AIHISA
📖Read
📄Papers📰Blogs🎬Courses
💡Learn
🛤️Paths📚Topics💡Concepts🎴Shorts
🎯Practice
📝Daily Log🎯Prompts🧠Review
SearchSettings
How I Study AI - Learn AI Papers & Lectures the Easy Way

Concepts3

Groups

📐Linear Algebra15📈Calculus & Differentiation10🎯Optimization14🎲Probability Theory12📊Statistics for ML9📡Information Theory10🔺Convex Optimization7🔢Numerical Methods6🕸Graph Theory for Deep Learning6🔵Topology for ML5🌐Differential Geometry6∞Measure Theory & Functional Analysis6🎰Random Matrix Theory5🌊Fourier Analysis & Signal Processing9🎰Sampling & Monte Carlo Methods10🧠Deep Learning Theory12🛡️Regularization Theory11👁️Attention & Transformer Theory10🎨Generative Model Theory11🔮Representation Learning10🎮Reinforcement Learning Mathematics9🔄Variational Methods8📉Loss Functions & Objectives10⏱️Sequence & Temporal Models8💎Geometric Deep Learning8

Category

🔷All∑Math⚙️Algo🗂️DS📚Theory

Level

AllBeginnerIntermediate
📚TheoryIntermediate

NP-Completeness

NP-completeness classifies decision problems that are both in NP and as hard as any problem in NP via polynomial-time reductions.

#np-complete#np-hard#polynomial-time reduction+12
📚TheoryAdvanced

P vs NP Problem

P vs NP asks whether every problem whose solutions can be verified quickly can also be solved quickly.

#p vs np#np-complete
Advanced
Filtering by:
#np-complete
#np-hard
+12
📚TheoryIntermediate

Complexity Theory

Complexity theory classifies problems by the resources required to solve or verify them, such as time and memory.

#complexity theory#p vs np#np-complete+12