NE (complexity)
id:
ne-complexity-249-4849726
title:
NE (complexity)
text:
In computational complexity theory, the complexity class NE is the set of decision problems that can be solved by a non-deterministic Turing machine in time O(kn) for some k. NE, unlike the similar class NEXPTIME, is not closed under polynomial-time many-one reductions.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/NE_(complexity)
date created:
date modified:
2023-02-28T23:16:22Z
main entity:
{"identifier":"Q6953653","url":"https://www.wikidata.org/entity/Q6953653"}
image:
fields total:
13
integrity:
13