Girish Mahajan (Editor)

ALL (complexity)

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit

In computability and complexity theory, ALL is the class of all decision problems.

Relations to other classes

ALL contains all of the complex classes of decision problems, including RE and co-RE.

References

ALL (complexity) Wikipedia


Similar Topics