Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2017

Highly Cited

2017

The analysis of signals defined over a graph is relevant in many applications, such as social and economic networks, big data or… Expand

Is this relevant?

2014

2014

In the index coding problem, introduced by Birk and Kol (INFOCOM, 1998), the goal is to broadcast an n bit word to n receivers… Expand

Is this relevant?

Highly Cited

2013

Highly Cited

2013

We study the quantum channel version of Shannon's zero-error capacity problem. Motivated by recent progress on this question, we… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity

We prove that an ω(log3n) lower bound for the three-party number-on-the-forehead (NOF) communication complexity of the set… Expand

Is this relevant?

2005

2005

We study the Lovasz number $\vartheta$ along with two related SDP relaxations $\vartheta_{1/2}$, $\vartheta_2$ of the… Expand

Is this relevant?

Highly Cited

2003

Highly Cited

2003

Sherali and Adams [SA90], Lov\''asz and Schrijver [LS91] and, recently, Lasserre [Las01b] have proposed lift and project methods… Expand

Is this relevant?

2000

2000

Let F be a compact subset of the n-dimensional Euclidean space Rn represented by (finitely or infinitely many) quadratic… Expand

Is this relevant?

Highly Cited

1994

Highly Cited

1994

We report on improved practical algorithms for lattice basis reduction. We propose a practical floating point version of theL3… Expand

Is this relevant?

Highly Cited

1988

Highly Cited

1988

We prove <italic>&thgr;</italic>(<italic>n</italic> log <italic>n</italic>) bounds for the deterministic 2-way communication… Expand

Is this relevant?

Highly Cited

1979

Highly Cited

1979

Delsarte's linear programming bound (an upper bound on the cardinality of cliques in association schemes) is compared with Lov… Expand

Is this relevant?