Lukas' Notes

Polynomial Decidable Binary Relation

May 01, 20261 min read

complexity-theory

Definition

Polynomial Decidable Binary Relation

A binary relation is called polynomial decidable if there exists an algorithm which, for a given v1​,v2​, decides whether (v1​,v2​)∈R in polynomial time.


Graph View

Backlinks

  • 192.017 Theoretical Computer Science
  • NP-Optimisation Problem
  • Nondeterministic Polynomial Complexity Class

Created with Quartz v4.4.0 © 2026

  • GitHub