{"version":"1.0","type":"link","title":"Nonelementary problem - Newikis","description":"In computational complexity theory, a nonelementary problem is a problem that is not a member of the class ELEMENTARY. As a class it is sometimes denoted as NONELEMENTARY. That is, it includes all decision problems that has no algorithmic solution with time bounded by an elementary recursive…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}