Lukas' Notes

complexity-theory

Definition

Polynomial Decidable Binary Relation

A binary relation is called polynomial decidable if there exists an algorithm which, for a given , decides whether in polynomial time.