Polynomial Time

Some articles on polynomial, polynomial time, time:

Resource Bounded Measure - Definition
... For instance, if instead of allowing any martingale, we require the martingale to be polynomial-time computable, then we obtain a definition of p-measure a set of sequences has p-measur ... conjecture, that NP does not have p-measure 0, amounts to proving that no polynomial-time martingale succeeds on all of NP ...
SC (complexity)
... complexity class of problems solvable by a deterministic Turing machine in polynomial time (class P) and polylogarithmic space (class PolyL) (that is, O((log n)k) space for some constant k) ... polylog), where DTISP stands for deterministic time and space ... it is required that the algorithm runs both in polynomial time and polylogarithmic space while for the latter, two separate algorithms will suffice One ...
Toda's Theorem
... theorem was proven by Seinosuke Toda in his paper "PP is as Hard as the Polynomial-Time Hierarchy" (1991) and was given the 1998 Gödel Prize ... The theorem states that the entire polynomial hierarchy PH is contained in PPP this implies a closely related statement, that PH is contained in P#P ... problem of giving an answer which is correct at least half the time ...
Strong Orientation - Algorithms and Complexity
... A strong orientation of a given bridgeless undirected graph may be found in linear time by performing a depth first search of the graph, orienting all edges in the depth first search tree away from the tree root, and ... of ordered pairs of vertices that must be connected by directed paths, it is possible in polynomial time to find an orientation of G that connects all the given pairs, if such an ... has a linear number of neighbors), the number of strong orientations may be estimated by a fully polynomial-time randomized approximation scheme ...
Conjunctive Query - Formal Properties of Conjunctive Queries
... An important class of conjunctive queries that have polynomial-time combined complexity are the acyclic conjunctive queries ... is LOGCFL-complete and thus in polynomial time ... relations for labeling the tree nodes) have polynomial time combined complexity ...

Famous quotes containing the word time:

    It’s a great advantage not to drink among hard-drinking people. You can hold your tongue and, moreover, you can time any little irregularity of your own so that everybody else is so blind that they don’t see or care.
    F. Scott Fitzgerald (1896–1940)