NTIME
id:
ntime-297-10888031
title:
NTIME
text:
In computational complexity theory, the complexity class NTIME(f(n)) is the set of decision problems that can be solved by a non-deterministic Turing machine which runs in time O(f(n)). Here O is the big O notation, f is some function, and n is the size of the input (for which the problem is to be decided).
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/NTIME
date created:
date modified:
2023-05-22T02:24:30Z
main entity:
{"identifier":"Q1933581","url":"https://www.wikidata.org/entity/Q1933581"}
image:
fields total:
13
integrity:
13