Skip to main content

Train Courses Problems Proof Blocks Tools Progress Account

⌄

AccountSign-in, membership, and settings Current courseCalculus IThemeAbout ProofAnvilLoading account…

Problem library

Find a problem

Search by course or topic.

Loading the problem library…

TrainCoursesProblemsProgressMoreTrain Courses Problems Progress

More

Proof Blocks Tools Account

ProofAnvil Practice$19 USD monthly · cancel any time

Pricing FAQ Features Roadmap Use with your agent Support Terms Privacy Refunds

Practice problems with hints and solutions · ProofAnvil

Problem library

Find a problem

Search by course or topic.

Search problems

Filters · 2 active

Area

AllMathPhysics

SubjectCourseTopic

Topic choices for Algorithms are shortened. Search still covers every problem.

StatusSkill

Skills match the applied subject and course.

Problem styleFind a private labelPrivate labelPrivate labels are visible only to you.Private labels ready.Favorites

Browsing still works.Sign in to use progress, saved problems and private labels. Problem search and previews remain available.

Progress labels

IndependentSolved with helpIncorrect / unresolvedDraft in progressNot attemptedReview due

Problem results

Sort

ProblemsClear skill: Intractability Build a practice set

ProblemCourse & topicStatus

ALG:9920251Consider SET COVER parameterized by the universe size p=|U|, while the number m of available sets may be much larger.

IntractabilityAlgorithms Problem Solving

Reductions, NP-completeness, and approximationAlgorithms · Mixed review

—

ALG:9920252A simple k-PATH is a path on exactly k distinct vertices.

IntractabilityAlgorithms Problem Solving

Reductions, NP-completeness, and approximationAlgorithms · Mixed review

—

ALG:9920253A tournament is an orientation of a complete graph.

IntractabilityAlgorithms Problem Solving

Reductions, NP-completeness, and approximationAlgorithms · Mixed review

—

ALG:9920254A cluster graph is a disjoint union of cliques.

IntractabilityAlgorithms Problem Solving

Reductions, NP-completeness, and approximationAlgorithms · Mixed review

—

ALG:9920255In UNDIRECTED FEEDBACK EDGE SET, the input is an undirected graph G and an integer k, and the question is whether…

IntractabilityAlgorithms Problem Solving

Reductions, NP-completeness, and approximationAlgorithms · Mixed review

—

ALG:9920256SUBSET SUM is parameterized here by its positive integer target B; all input integers are positive and binary encoded.

IntractabilityAlgorithms Problem Solving

Reductions, NP-completeness, and approximationAlgorithms · Mixed review

—

ALG:9920257Mathematical problem title

IntractabilityAlgorithms Problem Solving

Reductions, NP-completeness, and approximationAlgorithms · Mixed review

—

ALG:9920258Let G=(V,E) be a directed acyclic graph with designated vertices s,t.

IntractabilityAlgorithms Problem Solving

Reductions, NP-completeness, and approximationAlgorithms · Mixed review

—

ALG:9920259Mathematical problem title

IntractabilityAlgorithms Problem Solving

Reductions, NP-completeness, and approximationAlgorithms · Mixed review

—

ALG:9920260There are n applicants and n posts.

IntractabilityAlgorithms Problem Solving

Reductions, NP-completeness, and approximationAlgorithms · Mixed review

—

ALG:9920261Mathematical problem title

IntractabilityAlgorithms Problem Solving

Reductions, NP-completeness, and approximationAlgorithms · Mixed review

—

ALG:9920262Mathematical problem title

IntractabilityAlgorithms Problem Solving

Reductions, NP-completeness, and approximationAlgorithms · Mixed review

—

ALG:9920263Every edge of a directed graph G=(V,E) has a character label, a nonnegative cost, and a distinct fixed identifier.

IntractabilityAlgorithms Problem Solving

Reductions, NP-completeness, and approximationAlgorithms · Mixed review

—

ALG:9920264Let T be a rooted tree.

IntractabilityAlgorithms Problem Solving

Reductions, NP-completeness, and approximationAlgorithms · Mixed review

—

ALG:9920265Mathematical problem title

IntractabilityAlgorithms Problem Solving

Reductions, NP-completeness, and approximationAlgorithms · Mixed review

—

ALG:9920266Mathematical problem title

IntractabilityAlgorithms Problem Solving

Reductions, NP-completeness, and approximationAlgorithms · Mixed review

—

ALG:9920267Mathematical problem title

IntractabilityAlgorithms Problem Solving

Reductions, NP-completeness, and approximationAlgorithms · Mixed review

—

ALG:9920268Mathematical problem title

IntractabilityAlgorithms Problem Solving

Reductions, NP-completeness, and approximationAlgorithms · Mixed review

—

ALG:9920269Mathematical problem title

IntractabilityAlgorithms Problem Solving

Reductions, NP-completeness, and approximationAlgorithms · Mixed review

—

ALG:9920270The input is a set of n distinct strings, each of length L.

IntractabilityAlgorithms Problem Solving

Reductions, NP-completeness, and approximationAlgorithms · Mixed review

—

ALG:9920271Mathematical problem title

IntractabilityAlgorithms Problem Solving

Reductions, NP-completeness, and approximationAlgorithms · Mixed review

—

ALG:9920272Mathematical problem title

IntractabilityAlgorithms Problem Solving

Reductions, NP-completeness, and approximationAlgorithms · Mixed review

—

ALG:9920273Let G=(V,E) be a directed graph with a character and a nonnegative cost on each edge, and let A be a deterministic…

IntractabilityAlgorithms Problem Solving

Reductions, NP-completeness, and approximationAlgorithms · Mixed review

—

ALG:9920274Mathematical problem title

IntractabilityAlgorithms Problem Solving

Reductions, NP-completeness, and approximationAlgorithms · Mixed review

—

Showing 24 of 50 matching problems.

Private labels

Edit private labels

Add labels that only you can see.

Problem

Current labels

Private labels are unavailable. Close this editor and try again.

New label

Use a short label.

Let G have maximum degree

\Delta

, and consider INDEPENDENT SET parameterized jointly by the requested size k and…

A directed network is partitioned into layers

V_0,V_1,\ldots,V_L

, and every edge goes from

V_{i-1}

to

V_i

.

In a directed network, traversing edge e takes a positive integer time

\tau(e)

.

Let G=(V,E) be a directed graph whose vertices have characters

\lambda(v)\in\Sigma

and nonnegative weights w(v).

The input consists of demand patterns

p_1,\ldots,p_m

, candidate documents

x_1,\ldots,x_n

, and a positive cost

c_i

…

There are r fixed motif strings

p_1,\ldots,p_r

, an integer k, and oracle access to an unknown distribution…

Student i has a credential string

x_i

and begins at a vertex

a_i

of a directed graph with nonnegative edge lengths.

Let

X=X_1\cdots

X_n

be a string and D a dictionary.

Fix

k\ge2

.

A directed graph has m edges with integer capacities

u_e

.

An undirected graph G=(V,E) has nonnegative edge weights and a character

\lambda(v)

on every vertex.

For strings

X=X_1\cdots

X_n

and

Y=Y_1\cdots

Y_m

, an alignment is a path from (0,0) to (n,m) in the edit grid.