NP-easy

set of function problems that are solvable in polynomial time by a nondeterministic Turing machine with an oracle for some decision problem in NP
Thing complexity_class Q505373
Press Enter · cited answer in seconds

NP-easy

Summary

NP-easy is a complexity class[1]. NP-easy draws 8 Wikipedia views per month (complexity_class category, ranking #39 of 61).[2]

Key Facts

  • NP-easy's instance of is recorded as complexity class[3].
  • NP is named after NP-easy[4].
  • NP-easy's has part is recorded as NP-equivalent[5].
  • NP-easy's Freebase ID is recorded as /m/0f88v[6].
  • NP-easy's Microsoft Academic ID is recorded as 136417705[7].

Why It Matters

NP-easy draws 8 Wikipedia views per month (complexity_class category, ranking #39 of 61).[2] NP-easy has Wikipedia articles in 5 language editions, a strong signal of global cultural recognition.[8]

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). NP-easy. Retrieved May 3, 2026, from https://4ort.xyz/entity/np-easy
MLA “NP-easy.” 4ort.xyz Knowledge Graph, 4ort.xyz, 3 May. 2026, https://4ort.xyz/entity/np-easy.
BibTeX @misc{4ortxyz_np-easy_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{NP-easy}}, year = {2026}, url = {https://4ort.xyz/entity/np-easy}, note = {Accessed: 2026-05-03}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): NP-easy — https://4ort.xyz/entity/np-easy (retrieved 2026-05-03)

Canonical URL: https://4ort.xyz/entity/np-easy · Last refreshed: