A note on the stability number of an orthogonality graph
Authors:
- 1 October 2007
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 28 (7) , 1971-1979
Abstract
No abstract availableKeywords
All Related Versions
This publication has 8 references indexed in Scilit:
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite ProgrammingIEEE Transactions on Information Theory, 2005
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 ProgrammingMathematics of Operations Research, 2003
- The impossibility of pseudotelepathy without quantum entanglement2003
- Global Optimization with Polynomials and the Problem of MomentsSIAM Journal on Optimization, 2001
- Cost of Exactly Simulating Quantum Entanglement with Classical CommunicationPhysical Review Letters, 1999
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric conesOptimization Methods and Software, 1999
- Forbidden intersectionsTransactions of the American Mathematical Society, 1987
- A comparison of the Delsarte and Lovász boundsIEEE Transactions on Information Theory, 1979