Encyclopedia  |   World Factbook  |   World Flags  |   Reference Tables  |   List of Lists     
   Academic Disciplines  |   Historical Timeline  |   Themed Timelines  |   Biographies  |   How-Tos     
Sponsor by The Tattoo Collection
FNP (complexity)
Main Page | See live article | Alphabetical index

FNP (complexity)

In computational complexity theory, the complexity class FNP is the set of function problems which can be solved by a non-deterministic Turing machine in polynomial time.

This article is a stub. You can help Wikipedia by [ expanding it].