Rudolf Adamkovič
Personal site
Up:
Computer science
[
Top
]
[
Contents
]
P
A
complexity class
of every
decision problem
whose
every instance is solvable in polynomial time.
Synonyms
© 2025 Rudolf Adamkovič under
GNU General Public License
version 3.
Made with
Emacs
and secret alien technologies of yesteryear.