DTIME

Known as: DTIME(f(n)), Deterministic time, TIME(f(n)) 
In computational complexity theory, DTIME (or TIME) is the computational resource of computation time for a deterministic Turing machine. It… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Simulations can help enhance confidence in system designs but they provide almost no formal guarantees. In this paper, we present… (More)
  • table 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Assume a standard Brownian motion W = (Wt )t∈[0,1], a Borel function f : R → R such that f (W1) ∈ L2, and the standard Gaussian… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The LAMBDA method has been widely used in GNSS for fixing integer ambiguities. It can also solve any integer least squares (ILS… (More)
  • table 1
  • figure 2
  • figure 4
  • figure 5
  • figure 7
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Time synchronization is important for any distributed system. In particular, wireless sensor networks make extensive use of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2003
Highly Cited
2003
The running times of many computational science applications, such as protein-folding using ab initio methods, are much longer… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 8
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We present a novel approach to the aesthetic drawing of undirected graphs. The method has two phases: first embed the graph in a… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2001
Highly Cited
2001
  • Michel BenaÄ
  • 2001
This paper provides deterministic approximation results for stochastic processes that arise when ̄nite populations recurrently… (More)
Is this relevant?
Highly Cited
1992
Highly Cited
1992
The time-complexity of deterministic and randomized protocols for achieving broadcast (distributing a message from a source to… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Global register allocation plays a major role in determining the efficacy of an optimizing compiler. Graph coloring has been used… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1987
Highly Cited
1987
s of Presentation: Paul Beame: Time-Space Tradeoffs and Multiparty Communication Complexity9 Beate Bollig:Exponential Lower… (More)
  • figure 3.1
  • figure 4.1
  • figure 8.1
  • figure 4.1
  • figure 4.2
Is this relevant?