Results 1  10
of
139,787
Optimal SheraliAdams Gaps from Pairwise Independence
"... This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX kCSP(P)). We show that if the set of assignments accepted by P contains the support of a balanced pairwise independent distribution over the domain of the inputs, then such a problem on n variable ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
approximation. Our results can be viewed as an unconditional analogue of this result in the restricted computational model defined by the SheraliAdams hierarchy. We also introduce a new generalization of techniques to define consistent “local distributions ” over partial assignments to variables in the problem
Integrality gaps for sheraliadams relaxations
 In Proceedings of the FortyFirst Annual ACM Symposium on Theory of Computing
, 2009
"... We prove strong lower bounds on integrality gaps of Sherali–Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali–Adams relaxations that survive nδ rounds of lift and project. For MAX CUT and Vertex Cover, these show that even nδ rounds ..."
Abstract

Cited by 39 (2 self)
 Add to MetaCart
to obtain Sherali–Adams gap examples for any problem that has a Unique Games based hardness result (with some additional conditions on the reduction from Unique Games). Using this, we construct 2 − ε gap examples for Maximum Acyclic Subgraph that rules out any family of linear constraints with support
Tight Gaps for Vertex Cover in the SheraliAdams SDP Hierarchy
, 2011
"... We give the first tight integrality gap for Vertex Cover in the SheraliAdams SDP system. More precisely, we show that for every ɛ> 0, the standard SDP for Vertex Cover that is strengthened with the level6 SheraliAdams system has integrality gap 2 − ɛ. To the best of our knowledge this is the f ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
this is the first nontrivial tight integrality gap for the SheraliAdams SDP hierarchy for a combinatorial problem with hard constraints. For our proof we introduce a new tool to establish LocalGlobal Discrepancy which uses simple facts from highdimensional geometry. This allows us to give SheraliAdams solutions
Prosodic Morphology: constraint interaction and satisfaction
, 1993
"... Permission is hereby granted by the authors to reproduce this document, in whole or in part, for personal use, for instruction, or for any other noncommercial purpose. Table of Contents Acknowledgments......................................................... ..."
Abstract

Cited by 420 (31 self)
 Add to MetaCart
Permission is hereby granted by the authors to reproduce this document, in whole or in part, for personal use, for instruction, or for any other noncommercial purpose. Table of Contents Acknowledgments.........................................................
SheraliAdams Relaxations and Indistinguishability in Counting Logics
, 2012
"... Two graphs with adjacency matrices A and B are isomorphic if there exists a permutation matrix P for which the identity P T AP = B holds. Multiplying through by P and relaxing the permutation matrix to a doubly stochastic matrix leads to the linear programming relaxation known as fractional isomorph ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
isomorphism. We show that the levels of the SheraliAdams (SA) hierarchy of linear programming relaxations applied to fractional isomorphism interleave in power with the levels of a wellknown colorrefinementheuristic for graph isomorphism called the WeisfeilerLehman algorithm, orequivalently
Parametric Shape Analysis via 3Valued Logic
, 2001
"... Shape Analysis concerns the problem of determining "shape invariants"... ..."
Abstract

Cited by 660 (79 self)
 Add to MetaCart
Shape Analysis concerns the problem of determining "shape invariants"...
Constraint Logic Programming: A Survey
"... Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve in differe ..."
Abstract

Cited by 864 (25 self)
 Add to MetaCart
Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve
Analogical Mapping by Constraint Satisfaction
 COGNITIVE SCIENCE 13, 295 (1989)
, 1989
"... A theory of analogical mopping between source and target analogs based upon interacting structural, semantic, and pragmatic constraints is proposed here. The structural constraint of fsomorphfsm encourages mappings that maximize the consistency of relational corresondences between the elements of th ..."
Abstract

Cited by 389 (28 self)
 Add to MetaCart
the anology Is being used. The theory is implemented in a computer progrom called ACME (Analogical Constraint Mapping Engine), which represents constraints by means of a network of supporting and competing hypotheses regarding what elements to map. A coop erative algorithm for parallel constraint satisfaction
A solution to Plato’s problem: The latent semantic analysis theory of acquisition, induction, and representation of knowledge
 PSYCHOLOGICAL REVIEW
, 1997
"... How do people know as much as they do with as little information as they get? The problem takes many forms; learning vocabulary from text is an especially dramatic and convenient case for research. A new general theory of acquired similarity and knowledge representation, latent semantic analysis (LS ..."
Abstract

Cited by 1772 (10 self)
 Add to MetaCart
How do people know as much as they do with as little information as they get? The problem takes many forms; learning vocabulary from text is an especially dramatic and convenient case for research. A new general theory of acquired similarity and knowledge representation, latent semantic analysis
Results 1  10
of
139,787