Skip to search formSkip to main contentSkip to account menu

NTIME

Known as: Non-deterministic time, Nondeterministic time 
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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

14 relations
Advice (complexity)Complexity classComputational complexity theoryDSPACE

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
On Forecasting Amazon EC2 Spot Prices Using Time-Series Decomposition with Hybrid Look-Backs
Abstract-In this paper, we study forecasting through time series decomposition to predict Amazon Elastic Compute Cloud (EC2) Spot… 
2014
2014
An FPGA-Based Plant-on-Chip Platform for Cyber-Physical System Analysis
Digital control systems are traditionally designed independent of their implementation platform, assuming constant sensor… 
2005
2005
Using Symbolic DEVS Simulation to Generate Optimal Traffic Signal Timings
This article applies the advanced symbolic Discrete Event System Specification (DEVS) simulation method to the optimal signal… 
2005
2005
Synchro-tokens: a deterministic GALS methodology for chip-level debug and test
This paper describes a novel deterministic globally-asynchronous locally-synchronous (GALS) methodology called "synchro-tokens… 
2005
2005
Navigating in the Cayley graphs of SL_N(Z) and SL_N(F_p)
We give a non-deterministic algorithm that expresses elements of SL_N(Z), for N > 2, as words in a finite set of generators, with… 
2003
2003
Derandomization and distinguishing complexity
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [E. Allender (2001… 
1990
1990
A Note on the Almost-Everywhere Hierarchy for Nondeterministic Time
We present an a.e. complexity hierarchy for nondeterministic time, and show that it is essentially the best result which can be… 
1988
1988
Non-Horn clause logic programming without contrapositives
We present an extension of Prolog-style Horn clause logic programming to full first order logic. This extension has some… 
1978
1978
On time-space classes and their relation to the theory of real addition
A new lower bound on the computational complexity of the theory of real addition and several related theories is established: any… 
1974
1974
NONDETERMINISTIC TIME AND SPACE COMPLEXITY CLASSES
The marginal utility of the Turing machine computational resources running time and storage space are studied. A technique is… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)