Discrete Math

Tautology

A logical proposition that is true for every possible assignment of truth values to its variable is called a __________

P

The class of problems that can be solved (not just verified) in polynomial time is called __________

RSA

The cryptosystem that uses a public key for encryption and a private key for decryption is called _________

Integer Factorization

The hard mathematical problem that underlies the security of public-key cryptosystems is called the __________

Recurrence relation

An equation that defines a sequence by expressing its n-th term in terms of one or more earlier terms is called a _________

An unordered selection of elements from a set (without repetition) is called a __________

Combination

An algorithm that, at each step, makes the locally optimal choice in hope of reaching a global optimum is called a __________

Greedy algorithm

A connected graph that contains no cycles is called a __________

Tree

A path in a graph that visits every vertex exactly one is called a __________

Hamilton path

A spanning tree of a weighted graph whose total edge weight is as small as possible is called a __________

MST (Minimum Spanning Tree)