Welcome to IEEE Xplore 2.0: Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies

Cart | Sitemap | Help

Abstract


	BROWSE	SEARCH	IEEE XPLORE GUIDE	SUPPORT

View TOC

Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies
Khot, S. Naor, A.
Georgia Inst. of Technol., Atlanta;

This paper appears in: Foundations of Computer Science, 2007. FOCS '07. 48th Annual IEEE Symposium on
Publication Date: 21-23 Oct. 2007
On page(s): 318-328
Location: Providence, RI,
ISSN: 0272-5428
ISBN: 978-0-7695-3010-9
INSPEC Accession Number: 9800004
Digital Object Identifier: 10.1109/FOCS.2007.20
Current Version Published: 2007-11-27

Abstract
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A={a_ijk}_ij,k=1 ⁿ such that for all i,j,kisin{1,...,n} we have a_ijk=a_ikj=a_kji=a_jik=a_kij=a_kji and a_iik=a_ijj=a_iji=0, computes a number Alg(A) which satisfies with probability at least 1/2, Omega(radic(logn/n))ldrmax_xisin{-1,1} ⁿ Sigma_i,j,k=1 ⁿa_ijkx_ix_jx_klesAlg(A)lesmax_xisin{-1,1} ⁿ Sigma_i,j,k=1 ⁿa_ijkx_ix_jx_k. On the other hand, we show via a simple reduction from a result of Hastad and Venkatesh that under the assumption NPnsubeDTIME(n^(logn) ^O(1)),for every epsiv>0 there is no algorithm that approximates max_xisin{-1,1} ⁿ Sigma_i,j,k=1 ⁿa_ijkx_ix_jx_k within a factor of 2(logn)^t-epsiv in time 2^(logn) ^O(1). Our algorithm is based on a reduction to the problem of computing the diameter of a convex body in Rⁿ with respect to the L₁ norm. We show that it is possible to do so up to a multiplicative error of O(radic(n/logn)), while no randomized polynomial time algorithm can achieve accuracy O(radic(n/logn)). This resolves a question posed by Brieden, Gritzmann, Kantian, Klee, Lovasz and Simonos. We apply our new algorithm improve the algorithm of Hastad and Venkatesh or the Max-E3-Lin-2 problem. Given an over-determined system epsiv of N linear equations modulo 2 in nlesN Boolean variables, such that in each equation appear only three distinct variables, the goal is to approximate in polynomial time the maximum number of satisfiable equations in epsiv minus N/2 (i.e. we subtract the expected number of satisfied equations in a r- andom assignment). Hastad and Venkatesh obtained an algorithm which approximates this value up to a factor of O(radicN). We obtain a O(radic(n/logn)) approximation algorithm. By relating this problem to the refutation problem for random 3-CNF formulas we give evidence that obtaining a significant improvement over this approximation factor is likely to be difficult.

Index Terms
Available to subscribers and IEEE members.

References
Available to subscribers and IEEE members.

Citing Documents
Available to subscribers and IEEE members.

You are not logged in.

Guests may access Abstract records free of charge.