Results 1  10
of
564,922
On Average Time Hierarchies
 Information Processing Letters
, 1997
"... For a timeconstructible function T we give an explicit language L T which can be recognized in time T (n). We prove that any Turing machine that recognizes L T requires time close to T (n) for most inputs, thus forming an average time hierarchy. The existence of the average time hierarchy was kn ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
For a timeconstructible function T we give an explicit language L T which can be recognized in time T (n). We prove that any Turing machine that recognizes L T requires time close to T (n) for most inputs, thus forming an average time hierarchy. The existence of the average time hierarchy
The Analytic PolynomialTime Hierarchy
 Mathematical Logic Quaterly
, 1997
"... Motivated by results on interactive proof systems we investigate an 98hierarchy over P using word quantifiers as well as two types of set quantifiers. This hierarchy, which extends the (arithmetic) polynomialtime hierarchy, is called the analytic polynomialtime hierarchy. It is shown that every ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Motivated by results on interactive proof systems we investigate an 98hierarchy over P using word quantifiers as well as two types of set quantifiers. This hierarchy, which extends the (arithmetic) polynomialtime hierarchy, is called the analytic polynomialtime hierarchy. It is shown
Electronic Markets and Electronic Hierarchies
 Communications of the ACM
, 1987
"... This paper analyzes the fundamental changes in market structures that may result from the increasing use of information technology. First, an analytic framework is presented and its usefulness is demonstrated in explaining several major historical changes in American business structures. Then, the f ..."
Abstract

Cited by 684 (11 self)
 Add to MetaCart
, the framework is used to help explain how electronic markets and electronic hierarchies will allow closer integration of adjacent steps in the value added chains of our economy. The most surprising prediction is that information technology will lead to an overall shift toward proportionately more coordination
Hierarchies from Fluxes in String Compactifications
, 2002
"... Warped compactifications with significant warping provide one of the few known mechanisms for naturally generating large hierarchies of physical scales. We demonstrate that this mechanism is realizable in string theory, and give examples involving orientifold compactifications of IIB string theory a ..."
Abstract

Cited by 724 (33 self)
 Add to MetaCart
Warped compactifications with significant warping provide one of the few known mechanisms for naturally generating large hierarchies of physical scales. We demonstrate that this mechanism is realizable in string theory, and give examples involving orientifold compactifications of IIB string theory
On Heuristic Time Hierarchies Preliminary Version
"... We study the existence of time hierarchies for heuristic algorithms. We prove that a time hierarchy exists for heuristics algorithms in such syntactic classes as NP and coNP, and also in semantic classes AM and MA. Earlier, Fortnow and Santhanam (FOCS’04) proved the existence of a time hierarchy for ..."
Abstract
 Add to MetaCart
We study the existence of time hierarchies for heuristic algorithms. We prove that a time hierarchy exists for heuristics algorithms in such syntactic classes as NP and coNP, and also in semantic classes AM and MA. Earlier, Fortnow and Santhanam (FOCS’04) proved the existence of a time hierarchy
PP IS AS HARD AS THE POLYNOMIALTIME HIERARCHY*
"... Abstract. In this paper, two interesting complexity classes, PP and P, are compared with PH, the polynomialtime hierarchy. It is shown that every set in PH is polynomialtime Turing reducible to a set in PP, and PH is included in BP. 0)P. As a consequence of the results, it follows thatPPPH (or 03P ..."
Abstract
 Add to MetaCart
Abstract. In this paper, two interesting complexity classes, PP and P, are compared with PH, the polynomialtime hierarchy. It is shown that every set in PH is polynomialtime Turing reducible to a set in PP, and PH is included in BP. 0)P. As a consequence of the results, it follows thatPPPH (or 03
PolynomialTime Hierarchy on Randomized Machines
"... 1 Introduction Proving lower bounds remains one of the most challenging tasks in computationalcomplexity. Satisfiability, the seminal NPcomplete problem, is particularly unyielding in this respect. While we believe that any algorithm for satisfiabilitytakes time linear exponential in the number of ..."
Abstract
 Add to MetaCart
of variables in the formula, we have been unable to prove superlinear time lower bounds on random access machinesdespite several decades of effort. Additionally, problems complete for higher levels of the polynomialtime hierarchy, while not receiving as much attention, havealso resisted nontrivial time lower
Internet time synchronization: The network time protocol
, 1989
"... This memo describes the Network Time Protocol (NTP) designed to distribute time information in a large, diverse internet system operating at speeds from mundane to lightwave. It uses a returnabletime architecture in which a distributed subnet of time servers operating in a selforganizing, hierarchi ..."
Abstract

Cited by 617 (15 self)
 Add to MetaCart
This memo describes the Network Time Protocol (NTP) designed to distribute time information in a large, diverse internet system operating at speeds from mundane to lightwave. It uses a returnabletime architecture in which a distributed subnet of time servers operating in a self
Relating the Bounded Arithmetic and Polynomial Time Hierarchies
 Annals of Pure and Applied Logic
, 1994
"... The bounded arithmetic theory S 2 is finitely axiomatized if and only if the polynomial hierarchy provably collapses. If T 2 equals S then T 2 is equal to S 2 and proves that the polynomial time hierarchy collapses to # , and, in fact, to the Boolean hierarchy over # and to # i+1 / ..."
Abstract

Cited by 30 (1 self)
 Add to MetaCart
The bounded arithmetic theory S 2 is finitely axiomatized if and only if the polynomial hierarchy provably collapses. If T 2 equals S then T 2 is equal to S 2 and proves that the polynomial time hierarchy collapses to # , and, in fact, to the Boolean hierarchy over # and to # i+1
A theory of timed automata
, 1999
"... Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis of ..."
Abstract

Cited by 2651 (32 self)
 Add to MetaCart
Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis
Results 1  10
of
564,922