Results 1  10
of
7,254
Tight bounds on quantum searching
, 1996
"... We provide a tight analysis of Grover’s algorithm for quantum database searching. We give a simple closedform formula for the probability of success after any given number of iterations of the algorithm. This allows us to determine the number of iterations necessary to achieve almost certainty of f ..."
Abstract

Cited by 124 (9 self)
 Add to MetaCart
We provide a tight analysis of Grover’s algorithm for quantum database searching. We give a simple closedform formula for the probability of success after any given number of iterations of the algorithm. This allows us to determine the number of iterations necessary to achieve almost certainty
Tight bounds for worstcase equilibria
 Proc. 13th SODA
, 2002
"... We study the problem of traffic routing in noncooperative networks. In such networks, users may follow selfish strategies to optimize their own performance measure and therefore their behavior does not have to lead to optimal performance of the entire network. In this paper we investigate the worst ..."
Abstract

Cited by 172 (5 self)
 Add to MetaCart
case in which all m parallel links have the same speed, we can prove that the worstcase coordination ratio is Γ (−1) (m) + Θ(1) with Γ denoting the Gamma (factorial) function. Our bounds entirely resolve an open problem posed recently by Koutsoupias and Papadimitriou [KP99].
Tightly Bound Composite Higgs ∗†
, 1992
"... We explain general features of the tightly bound composite Higgs models proposed in recent years; walking technicolor, strong ETC technicolor, and a top quark condensate, etc.. These models are all characterized by the large anomalous dimension due to nontrivial short distance dynamics in the gauged ..."
Abstract
 Add to MetaCart
We explain general features of the tightly bound composite Higgs models proposed in recent years; walking technicolor, strong ETC technicolor, and a top quark condensate, etc.. These models are all characterized by the large anomalous dimension due to nontrivial short distance dynamics
TIGHTLY BOUNDED COMPLETIONS
"... Abstract. By a ‘completion ’ on a 2category K we mean here an idempotent pseudomonad on K. We are particularly interested in pseudomonads that arise from KZdoctrines. Motivated by a question of Lawvere, we compare the Cauchy completion [23], defined in the setting of VCat for V a symmetric monoida ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
doctrines that are relevant to this discussion (Karoubi, Cauchy, Stack, Grothendieck) may be regarded as ‘bounded’, only the Cauchy and the Grothendieck completions are ‘tightly bounded ’ – two notions that we introduce and study in this paper. Tightly bounded KZdoctrines are shown to be idempotent. We also show, in a
Tight Bounds for Asynchronous Renaming
, 2011
"... This paper presents the first tight bounds on the complexity of sharedmemory renaming, a fundamental problem in distributed computing in which a set of processes need to pick distinct identifiers from a small namespace. We first prove an individual lower bound of Ω(k) process steps for deterministi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper presents the first tight bounds on the complexity of sharedmemory renaming, a fundamental problem in distributed computing in which a set of processes need to pick distinct identifiers from a small namespace. We first prove an individual lower bound of Ω(k) process steps
Tight bounds for clock synchronization
 In Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM
"... Abstract. We present a novel clock synchronization algorithm and prove tight upper and lower bounds on the worstcase clock skew that may occur between any two participants in any given distributed system. More importantly, the worstcase clock skew between neighboring nodes is (asymptotically) at m ..."
Abstract

Cited by 23 (6 self)
 Add to MetaCart
Abstract. We present a novel clock synchronization algorithm and prove tight upper and lower bounds on the worstcase clock skew that may occur between any two participants in any given distributed system. More importantly, the worstcase clock skew between neighboring nodes is (asymptotically
Tight Bounds on the Learnability of Evolution
, 1999
"... Evolution is often modeled as a stochastic process which modifies DNA. One of the most popular such processes are the CavenderFarris (CF) trees, which are represented as edge weighted trees. The Phylogeny Construction Problem is that of, given k samples drawn from a CF tree, output a CF tree which ..."
Abstract

Cited by 25 (1 self)
 Add to MetaCart
variant on one of the most popular algorithms used by practitioners, converges on the true tree at a rate which differs from the optimum by a constant. We do this by analyzing upper and lower bounds for the convergence rate of learning very simple CF trees, and then show that the learnability of each CF
Tight bounds for HTN planning
 In Proc. of the 25th Intl. Conf. on Automated Planning and Scheduling (ICAPS
"... Although HTN planning is in general undecidable, there are many syntactically identifiable subclasses of HTN problems that can be decided. For these subclasses, the decision procedures provide upper complexity bounds. Lower bounds were often not investigated in more detail, however. We generalize ..."
Abstract

Cited by 5 (5 self)
 Add to MetaCart
Although HTN planning is in general undecidable, there are many syntactically identifiable subclasses of HTN problems that can be decided. For these subclasses, the decision procedures provide upper complexity bounds. Lower bounds were often not investigated in more detail, however. We
Tight bounds for strategyproof classification
 In Proc. of 10th AAMAS
, 2011
"... Strategyproof (SP) classification considers situations in which a decisionmaker must classify a set of input points with binary labels, minimizing expected error. Labels of input points are reported by selfinterested agents, who may lie so as to obtain a classifier more closely matching their own ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
of social welfare) that an SP mechanism can guarantee for n agents. Our primary result is a lower bound of 3 − 2 on the approximation ratio of SP mechanisms under n the shared inputs assumption; this shows that the previously known upper bound (for uniform weights) is tight. The proof relies on a result
A Tight Bound for EMAC
"... Abstract. We prove a new upper bound on the advantage of any adversary for distinguishing the encrypted CBCMAC (EMAC) based on random permutations from a random function. Our proof uses techniques recently introduced in [BPR05], which again were inspired by [DGH + 04]. The bound we prove is tight — ..."
Abstract
 Add to MetaCart
Abstract. We prove a new upper bound on the advantage of any adversary for distinguishing the encrypted CBCMAC (EMAC) based on random permutations from a random function. Our proof uses techniques recently introduced in [BPR05], which again were inspired by [DGH + 04]. The bound we prove is tight
Results 1  10
of
7,254