Rudy’s OBTF Rudolf Adamkovič

Home / Computer science

P

The complexity class of decision problems whose

all instances are solvable in polynomial time.

© 2025 Rudolf Adamkovič under GNU General Public License (GPL) version 3 or later.
Made with Emacs and secret alien technologies of yesteryear.