NONELEMENTARY

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In computational complexity theory, the complexity class NONELEMENTARY is the complement of the class ELEMENTARY.

Example decidable problems in NONELEMENTARY are: