Rudolf Adamkovič Personal site

Up: Computational complexity [Top][Contents]

P

P class
polynomial time class

Define

… as a complexity class of every decision problem whose

every instance is solvable in polynomial time.

Up: Computational complexity [Top][Contents]

© 2024 Rudolf Adamkovič under GNU General Public License version 3.
Made with Emacs and secret alien technologies of yesteryear.