Lições — Faculdade

A bright university lecture hall with large windows and sunlight streaming in. A whiteboard shows two parallel Turing machine diagrams, each with a glowing "ORACLE" box labeled A and B respectively — one with "Pᴬ = NPᴬ" and one with "Pᴮ ≠ NPᴮ" written cleanly beside them. A confident professor gestures between both diagrams, chalk in hand, surrounded by engaged students with open laptops and notebooks.

A bright university computer science classroom with large sunny windows. A whiteboard displays a clean diagram: a labeled memory bar divided into sections — "Input Space" in blue, "Auxiliary Space" in orange — with notation "O(n)" and "O(1)" beside stacked blocks of varying heights. A cheerful student points to the diagram while another sketches a graph showing memory usage curves against input size n on graph paper.

A bright university whiteboard scene flooded with afternoon sunlight. A professor points to a clean diagram showing a horizontal axis labeled "Approximation Ratio" with markers at 1.0 (Optimal), 1.5, and 2.0. Above, two problem boxes labeled "Vertex Cover" and "Max-Clique" sit inside a bold red barrier zone marked "Inapproximable Region," while a green checkmark region labeled "PTAS" glows on the left. Colored arrows show shrinking gaps toward optimality.

A bright university classroom setting with two students at a sunlit whiteboard. One student (the "Prover") confidently points to a clean diagram showing a graph coloring problem, while the other (the "Verifier") holds cards labeled with random challenge questions. Between them, a cheerful dialogue-bubble flowchart shows alternating arrows labeled "Claim," "Challenge," and "Response." A side panel clearly displays "IP = PSPACE" with a colorful complexity hierarchy ladder showing NP, co-NP nested inside IP.

A bright university whiteboard classroom bathed in warm daylight. A cheerful diagram shows two labeled boxes: "Classical Complexity" with a towering mountain labeled "n" and "Parameterized Complexity" with the same mountain but a small manageable side trail labeled "f(k) · nᶜ". A friendly equation "FPT = f(k) · poly(n)" sits prominently. Colorful arrows isolate a glowing parameter bubble "k" separating hard from tractable regions, making the impossible climb suddenly approachable.

A bright university study space with a large whiteboard displaying a clean complexity graph on a light cream background. The x-axis shows "Input Size n" and y-axis shows "Time," with three clearly labeled curves rising left to right: a gentle blue curve labeled "P (polynomial)," a steep red curve labeled "EXPTIME (exponential)," and a sky-blue sky visible through large windows. A friendly student points enthusiastically at the diverging curves with a marker.

A bright, sunlit computer science classroom with a large whiteboard displaying a clean distributed graph: six cheerful circular nodes labeled P1–P6 in bold blue, connected by colorful curved edges with small envelope icons representing messages in transit. Student figures at desks sketch the diagram on tablets. Arrows show parallel task flows between nodes. A corner label reads "Consensus Protocol" above a simple checkmark diagram. Warm yellow light fills the scene.

A bright university whiteboard scene bathed in warm daylight. A cheerful diagram shows a number line labeled "Solution Quality" with markers: OPT (gold star), and algorithm solution slightly right, with a clear bracket labeled "≤ c · OPT" in red. Nearby, a colorful bar chart compares "Exact" (impossibly tall, labeled "∞ time") versus "Approx" (short, green, labeled "fast!"). A friendly robot confidently points to the approximation bar.

A bright university whiteboard scene bathed in warm daylight. A clean white board displays two labeled problem boxes — "Problem A" and "Problem B" — connected by a bold arrow labeled "≤_m" representing a many-one reduction. Surrounding the board, colorful sticky notes show "NP-Complete," "Cook's Theorem," and "P vs NP?". A cheerful student points at the diagram with a marker, gears and puzzle pieces decorating the margins in teal, orange, and yellow.

A bright, sunlit whiteboard classroom scene showing a friendly Turing machine diagram splitting into three colorful branching paths — each path drawn as a distinct pastel-colored tape with a read/write head icon. The leftmost path glows green ("ACCEPT"), while others show yellow question marks. A bold tree-branch diagram above labels the split "NTM branches simultaneously." Clean arrows and the label "poly-time?" anchor the concept. Cheerful, clear, energetic composition on a white background.

Two friendly stick-figure characters, Alice and Bob, sit at bright white desks on opposite sides of a sunny classroom, each holding colorful input cards labeled "x" and "y." Between them floats a clean whiteboard showing a simple function "f(x,y)=?" with arrows indicating back-and-forth message bubbles labeled "1 bit," "2 bits." A tally counter tracks total communication cost, surrounded by cheerful blue and yellow geometric accents.

A bright university whiteboard bathed in warm afternoon sunlight displays two large overlapping circles labeled "P" and "NP" in bold colors — one yellow, one blue. A cheerful student in a colorful sweater points at the boundary between circles with a marker. Surrounding the board are floating puzzle pieces, padlocks, and checkmarks illustrating verification versus solving. Clean desk, sunlit windows, optimistic classroom atmosphere.

A bright university lecture hall bathed in warm daylight, a large whiteboard displaying a clean diagram: on the left, a glowing padlock labeled "RSA" connected by an arrow to a large integer "N = p × q," with a crossed-out path labeled "Factor N?" showing a branching complexity tree. A Venn diagram circles labeled "P" nested inside "NP" sits beside it. A confident professor points to the board while students lean forward with notebooks open.

A bright, sunlit university classroom whiteboard filled with clean mathematical graphs showing algorithmic growth curves labeled O(1), O(log n), O(n), O(n²), each drawn in distinct bold colors ascending at different rates. A friendly professor points enthusiastically at the curves. Colorful sticky notes highlight key terms. A large input-size axis labeled "n" stretches rightward, with growth rate on the vertical axis. Clear daylight streams through tall windows.

A bright university whiteboard filled with a clean Boolean decision tree diagram: a root node labeled "x₁=?" branching into two paths marked "0" and "1", each leading to further query nodes "x₂=?" and "x₃=?", terminating in leaf nodes showing "YES" or "NO" outputs. Color-coded edges in teal and orange highlight query paths. A complexity formula "D(f) ≤ n" sits neatly in the corner. Sunlit classroom, clear organized layout, cheerful academic atmosphere.

A bright, sunlit university workspace with a cheerful illustrated Turing machine diagram: a long horizontal tape stretching across a white board, divided into clean square cells containing symbols (0, 1, B). A friendly mechanical read/write head hovers over the tape, with small arrows showing left/right movement. A neat state-transition table labeled Q0→Q1 sits beside it. Warm yellow lighting, crisp blues and oranges, textbooks nearby, optimistic academic atmosphere.

A bright university lecture hall with large sunlit windows. A cheerful professor points to a clean whiteboard displaying the Chomsky Hierarchy as four nested colorful rectangles labeled "Regular," "Context-Free," "Context-Sensitive," and "Recursively Enumerable" in yellow, green, blue, and orange. Small automata icons — finite state machines, pushdown stacks, Turing machines — sit beside each layer. Students take notes enthusiastically, textbooks open on desks.

A bright university study room with large sunlit windows. A student stands at a clean whiteboard drawing a cheerful curve labeled "VC Dimension" with two zones marked "Underfit" and "Overfit" bracketing a glowing sweet-spot arc. Nearby, colorful decision boundary diagrams show simple vs. complex model curves. A small complexity ladder illustration displays "P → NP-hard" steps. Books and laptops surround the engaged, curious student in warm afternoon light.

A bright, sunlit university study space with a large whiteboard showing nested bubbles labeled "P," "NP," and "EXPTIME" in clean bold lettering. A cheerful student at a wooden desk operates a stylized Turing machine diagram — a friendly tape with symbols and a read-write head illustrated as a small robot arm. Bookshelves with colorful spines line warm cream walls. Sunlight streams through tall windows, casting cheerful shadows.

Bright university computer science lab, large floor-to-ceiling windows flooding the room with daylight. A central whiteboard displays a clean flowchart of an algorithm branching and rerouting itself, with labeled nodes marked "t=0," "t=1," "t=2" showing evolution over time. A student confidently points to a node where a path dynamically redirects. Colorful arrows illustrate updated decision paths. Nearby monitors display shifting network graphs adapting in real time, edges adding and rerouting smoothly.

A bright, sunlit university whiteboard filled with a clean planar graph drawn in bold cobalt blue lines, nodes marked as cheerful yellow circles. Labeled edges show "min-cut = 3" with a dashed red partition line dividing the graph into two regions. Nearby, a small complexity ladder diagram lists "P → NP → NP-Hard" in crisp black marker. A open textbook beside the board shows a network flow diagram with annotated capacities.

A bright university whiteboard filled with a clean diagram of the Traveling Salesman Problem: a dozen labeled city dots connected by two routes — one jagged expensive red path marked "OPTIMAL?" and one smooth efficient blue path marked "1.5× OPT" glowing with approval. A confident student points to a polynomial-time complexity curve labeled "O(n²)" beside a steep exponential curve. Sunny classroom, warm light, colorful markers scattered on desks.

Bright university lecture hall bathed in warm afternoon sunlight. A large whiteboard displays a clean algebraic circuit diagram: nodes labeled "+", "×", "−" connected by arrows, computing a polynomial expression "f(x) = x⁴ + 3x² + 1" step-by-step. Scattered nearby are colorful annotated papers showing finite field grids and factorization trees. Two engaged students sketch circuit diagrams, surrounded by textbooks, coffee cups, and cheerful green plants on a light oak desk.

A bright university whiteboard scene in a sunlit classroom. A professor's hand draws a large funnel labeled "Kernelization" with a complex tangled graph of many nodes flowing into the wide top, and a small clean simplified graph emerging from the narrow bottom labeled "Kernel (size = f(k))". Nearby, a number line marks parameter k with values 1, 2, 3. Color-coded arrows show "polynomial reduction" steps in orange, blue, and green on a white background.

A bright university laboratory bathed in warm daylight, where two researchers at clean white workbenches exchange a secure quantum key. A cheerful diagram on a glowing whiteboard shows the BB84 protocol: labeled photon polarization states (↑ ↗ → ↘) with colored arrows, Alice and Bob stick-figure icons connected by a blue fiber-optic line, and a red "Eavesdropper Detected!" flag. Quantum superposition illustrated as overlapping colored circles labeled "0+1" floats nearby.

A bright university lecture hall with large sunlit windows. A clean whiteboard displays a clear hierarchy diagram: "FO ⊂ SO" with labeled boxes connecting "First-Order Logic," "Second-Order Logic," and complexity classes "AC⁰," "PH," "PSPACE." A cheerful professor gestures toward logical formulas written in vivid blue and orange marker. Open textbooks and laptops sit on well-lit desks. Students take notes with engaged expressions.

A bright university lecture hall bathed in warm afternoon light, where a large whiteboard displays a clean game-theory payoff matrix labeled "Player A / Player B" with bold colored arrows pointing toward a highlighted Nash equilibrium cell. Three students at a sunlit seminar table lean forward animatedly, each holding strategy cards. Above them, a cheerful diagram shows interconnected nodes representing players linked by arrows labeled "incentive compatible," with a golden trophy icon marking the optimal mechanism outcome.

A bright university whiteboard filled with a clean Chomsky hierarchy pyramid diagram — four labeled tiers: "Regular," "Context-Free," "Context-Sensitive," "Recursively Enumerable" — each tier a different cheerful color block. Alongside it, three friendly illustrated machines: a small finite automaton, a pushdown automaton with a visible stack, and a Turing machine with a readable tape. Sunlit classroom, students engaged, warm natural light pouring through tall windows.

A bright university whiteboard filled with clean, colorful nested oval diagrams showing complexity classes: a sunny yellow innermost oval labeled "P" containing tiny icons of sorted lists and number lines, surrounded by a sky-blue oval labeled "NP" with puzzle pieces, then larger lavender ovals for "PSPACE" and "EXPTIME" beyond. A cheerful student in a sunlit classroom points to "O(n^k)" written in bold orange marker, textbooks open on a wooden desk nearby.

A bright university study room with large sunlit windows. A whiteboard displays a clean complexity hierarchy diagram: boxes labeled **P**, **NP**, **PH** connected by arrows, with **S₁²** and **T₁²** annotations linking to **P**. A focused student sketches polynomial-time function graphs on graph paper beside open textbooks. Colorful sticky notes mark key theorems. Warm daylight fills the scene, with coffee mugs and highlighted notes creating an energetic academic atmosphere.

A bright university lecture hall bathed in warm daylight, where a large whiteboard displays a flowing river diagram labeled "DynFO → DynP" with small colored nodes updating along branching paths. A cheerful student at a glowing desktop adjusts one node in a network graph, and only nearby connected nodes visually refresh with fresh color—while unchanged nodes stay still. Clean labels read "Δ input" and "update only" alongside crisp arrows showing incremental change.

Bright university whiteboard scene flooded with natural daylight. A confident student draws two large labeled boxes: "Problem A" and "Problem B" connected by a bold curved arrow labeled "≤_p" (polynomial-time reduction). Colorful transformation arrows show an input instance morphing shape from left box to right box. A side panel lists "NP-Complete" with checkmarks. Clean geometric puzzle pieces interlock between boxes, suggesting equivalent difficulty. Blue, orange, and green markers throughout.

Two university students sit across from each other at a bright white table in a sunlit study room, a large payoff matrix grid displayed on a whiteboard behind them. The matrix shows labeled rows "Player A" and columns "Player B" with numerical payoff pairs like (3,2) and (1,4) in colorful cells. Game theory arrows highlight Nash equilibrium intersections in yellow. Strategy cards labeled "Mixed" and "Pure" rest on the table.

Bright university lecture hall bathed in warm sunlight. A large whiteboard displays a clean probability tree branching into "YES/NO" outcomes, labeled "BPP" and "RP" in bold color. A confident student tosses a coin while flowchart arrows show Monte Carlo and Las Vegas algorithm paths. Scattered papers show "P(success) ≥ 2/3" and randomized pseudocode fragments. Small portraits labeled "Blum" and "Goldwasser" pin the corner. Cheerful, crisp, academic atmosphere.

A bright university lab setting with whiteboards covered in clean circuit diagrams showing layered AND, OR, NOT gates arranged in neat horizontal depth-levels. A cheerful student points to a highlighted path through the circuit, with labels "Size = 12 gates" and "Depth = 4 layers" marked clearly. A small annotation shows "PARITY lower bound" beside a staircase-like gate arrangement. Sunlight streams through tall windows onto tidy desks with open textbooks.

A bright university research lab with large windows and natural daylight. A focused student at a clean whiteboard draws a complexity curve graph labeled "O(n log n)" and "O(n²)" with colorful markers, comparing AI model efficiency. Nearby, an open laptop displays a neural network diagram. Sticky notes show "Time," "Space," and "Data" constraints. Bookshelves and a coffee mug complete the warm, organized academic workspace.

Bright university computer lab, large whiteboard filled with a colorful task-scheduling timeline showing three parallel horizontal lanes labeled "Task A," "Task B," "Task C" with cheerful color-blocked time segments and arrows indicating synchronization points. A student at a sunlit desk arranges glowing priority cards into neat stacks. Clean diagrams show resource allocation bars and a simple "Deadline ✓" checkmark. Warm natural light streams through tall windows, giving the scene an energetic, optimistic atmosphere.

A bright university study space with large windows letting in sunlight. A student holds two scrolls side by side: one labeled **"AAAAAAAAAA..."** with a short arrow pointing to a tiny note reading **"10×A"**, and another scroll of random characters **"10110100..."** with a long tangled arrow looping back to itself. A chalkboard shows **K(x) ≈ len(x)** for the complex string. Clean, optimistic, bold colors.

Sunlit university lecture hall with large whiteboards showing nested complexity bubbles labeled "P," "NP," and fine-grained sub-regions between them with dashed boundary lines. A confident professor points to a magnifying glass illustration zooming into the P-NP borderline, revealing smaller labeled zones: "O(n²)," "O(n^1.5)." Students at bright desks sketch graphs. Colored arrows connect specific problem nodes like "3SUM" and "APSP" within the diagram.