Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4. Management Origin Inist-CNRS Database PASCAL INIST identifier 18041377 Computer arithmetics Discipline Computer science : theoretical automation and systems Mathematics Operational research. Management science / 001D01A Operational research and scientific management / 001D01A03 Mathematical programming Pascal 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science control theory systems / 001D02A Theoretical computing / 001D02A05 Algorithmics. 2006, Vol 35, Num 4, pp 787-803, 17 p ref : 28 ref ISSN 0097-5397 Scientific domain Computer science Mathematics Publisher Society for Industrial and Applied Mathematics, Philadelphia, PA Publication country United States Document type Conference Paper Language English Author keyword 15A23 68Q01 90C22 90C27 Grothendieck's inequality Szemerédi partitions 68W25 approximation algorithms cut-norm semidefinite programming Keyword (fr) Algorithme approximation Hyperplan Matrice dense Matrice réelle Programmation semi définie Algorithme graphe Inégalité Grothendieck Norme coupe Partition Szemerédi Keyword (en) Approximation algorithm Hyperplane Dense matrix Real matrix Semi definite programming Graph algorithm Grothendieck's inequality Cut-norm Szemerédi partition Keyword (es) Algoritmo aproximación Hiperplano Matriz densa Matriz real Programacíon semi definida Classification Pascal 001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02C Algebra / 001A02C06 Linear and multilinear algebra, matrix theory Pascal 001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Sa codimension serait un entier strictement inférieur à 1, et il ny a que 0 qui convienne. Ce qui veut dire quil ny a pas de place pour un sev entre lhyperplan et lespace entier. University of Chicago, United States Source Cest la définition dun hyperplan : la dimension dun supplémentaire est 1. Microsoft Research, One Microsoft Way 113/2131, Redmond, WA 98052-6399, United States Conference title Thirty-Sixth Annual ACM Symposium on Theory of Computing (STOC 2004) Conference name STOC 2004 : Annual ACM Symposium on Theory of Computing (36 Chicago, IL ) Author (monograph) BABAI, László (Editor) 1 ACM, Special Interest Group on Algorithms and Computation Theory, United States (Organiser of meeting) Schools of Mathematics and Computer Science, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv 69978, Israel CopyPermanent link Copy Approximating the cut-norm via Grothendieck's inequality Author ALON, Noga 1 NAOR, Assaf 2
0 kommentar(er)
