Results 1  10
of
910
Circuit Lower Bounds Collapse Relativized Complexity Classes
, 1998
"... Since the publication of Furst, Saxe, and Sipser's seminal paper connecting AC 0 with the polynomial hierarchy [FSS84], it has been well known that circuit lower bounds allow you to construct oracles that separate complexity classes. We will show that similar circuit lower bounds allow you to ..."
Abstract
 Add to MetaCart
to construct oracles that collapse complexity classes. For example, based on Hastad's parity lower bound, we construct an oracle such that P = PH ae \PhiP = EXP. Dept. of Electrical Engineering and Computer Science, University of Illinois at Chicago, Rm. 1120, SEO Building, M/C 154, 851 S. Morgan St
Ricci Flow with Surgery on ThreeManifolds
"... This is a technical paper, which is a continuation of [I]. Here we verify most of the assertions, made in [I, §13]; the exceptions are (1) the statement that a 3manifold which collapses with local lower bound for sectional curvature is a graph manifold this is deferred to a separate paper, as the ..."
Abstract

Cited by 448 (2 self)
 Add to MetaCart
This is a technical paper, which is a continuation of [I]. Here we verify most of the assertions, made in [I, §13]; the exceptions are (1) the statement that a 3manifold which collapses with local lower bound for sectional curvature is a graph manifold this is deferred to a separate paper
Collapsing riemannian manifolds while keeping their curvature bounded
 I, J. Differential Geometry
, 1986
"... This is the second of two papers concerned with the situation in which the injectivity radius at certain points of a riemannian manifold is "small" compared to the curvature. In Part I [3], we introduced the concept of an Fstructure of positive ..."
Abstract

Cited by 122 (6 self)
 Add to MetaCart
This is the second of two papers concerned with the situation in which the injectivity radius at certain points of a riemannian manifold is "small" compared to the curvature. In Part I [3], we introduced the concept of an Fstructure of positive
The Collapse of the Bounded Width Hierarchy
, 2014
"... We show that every constraint satisfaction problem over a fixed constraint language that has bounded relational width has also relational width (2, 3). Together with known results this gives a trichotomy for width: a constraint satisfaction problem has either relational width 1, or relational width ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We show that every constraint satisfaction problem over a fixed constraint language that has bounded relational width has also relational width (2, 3). Together with known results this gives a trichotomy for width: a constraint satisfaction problem has either relational width 1, or relational width
Minimal entropy and collapsing with curvature bounded from below
 Invent. Math
"... Abstract. We show that if a closed manifold M admits an Fstructure (not necessarily polarized, possibly of rank zero) then its minimal entropy vanishes. In particular, this is the case if M admits a nontrivial S 1action. As a corollary we obtain that the simplicial volume of a manifold admitting ..."
Abstract

Cited by 37 (4 self)
 Add to MetaCart
an Fstructure is zero. We also show that if M admits an Fstructure then it collapses with curvature bounded from below. This in turn implies that M collapses with bounded scalar curvature or, equivalently, its Yamabe invariant is nonnegative. We show that Fstructures of rank zero appear rather
The covariant entropy bound in gravitational collapse
, 2004
"... Abstract: We study the covariant entropy bound in the context of gravitational collapse. First, we discuss critically the heuristic arguments advanced by Bousso. Then we solve the problem through an exact model: a TolmanBondi dust shell collapsing into a Schwarzschild black hole. After the collapse ..."
Abstract
 Add to MetaCart
Abstract: We study the covariant entropy bound in the context of gravitational collapse. First, we discuss critically the heuristic arguments advanced by Bousso. Then we solve the problem through an exact model: a TolmanBondi dust shell collapsing into a Schwarzschild black hole. After
Collapsed variational inference for HDP
 In Advances in Neural Information Processing Systems
"... Abstract A wide variety of Dirichletmultinomial 'topic' models have found interesting applications in recent years. While Gibbs sampling remains an important method of inference in such models, variational techniques have certain advantages such as easy assessment of convergence, easy op ..."
Abstract

Cited by 57 (1 self)
 Add to MetaCart
optimization without the need to maintain detailed balance, a bound on the marginal likelihood, and sidestepping of issues with topicidentifiability. The most accurate variational technique thus far, namely collapsed variational latent Dirichlet allocation, did not deal with model selection nor did
Inference with an incomplete model of english auctions
 JOURNAL OF POLITICAL ECONOMY
, 2003
"... While English auctions are the most common in practice, their rules typically lack sufficient structure to yield a tractable theoretical model without significant abstractions. Rather than relying on one stylized model to provide an exact interpretation of the data, we explore an incomplete model ba ..."
Abstract

Cited by 154 (7 self)
 Add to MetaCart
on the distribution function characterizing bidder demand, on the optimal reserve price, and on the effects of observable covariates on bidder valuations. If the standard theoretical model happens to be the true model, our bounds collapse to the true features of interest. In contrast, when the true data
Bayesian Inference with Missing Data Using Bound and Collapse
 Journal of Computational and Graphical Statistics
, 1997
"... Current Bayesian methods to estimate conditional probabilities from samples with missing data pose serious problems of robustness and computational efficiency. This paper introduces a new method, called Bound and Collapse (bc), able to overcome these problems. When no information is available on the ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
Current Bayesian methods to estimate conditional probabilities from samples with missing data pose serious problems of robustness and computational efficiency. This paper introduces a new method, called Bound and Collapse (bc), able to overcome these problems. When no information is available
Collapsing Closures
"... Abstract. A description in the Jacobs and Langen domain is a set of sharing groups where each sharing group is a set of program variables. The presence of a sharing group in a description indicates that all the variables in the group can be bound to terms that contain a common variable. The expressi ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract. A description in the Jacobs and Langen domain is a set of sharing groups where each sharing group is a set of program variables. The presence of a sharing group in a description indicates that all the variables in the group can be bound to terms that contain a common variable
Results 1  10
of
910