نتائج البحث

A BETTER ALGORITHM FOR RANDOM k-SAT.

• Authors : Coja-Oghlan, Amin¹

• Source: SIAM Journal on Computing. 2010, Vol. 39 Issue 7, p2823-2864. 42p. 1 Diagram, 1 Chart.

تفاصيل العنوان

APPROXIMATING FRACTIONAL PACKINGS AND COVERINGS IN O(1/ϵ) ITERATIONS.

• Authors : Bienstock, D.¹ ; Iyengar, G.¹

• Source: SIAM Journal on Computing. 2006, Vol. 35 Issue 4, p825-854. 30p.

تفاصيل العنوان

Some 3CNF Properties Are Hard to Test.

• Authors : Ben-Sasson, Eli¹ ; Harsha, Prahladh² ; Raskhodnikova, Sofya³

• Source: SIAM Journal on Computing. 2005, Vol. 35 Issue 1, p1. 23p.

تفاصيل العنوان

THE APPROXIMABILITY OF THREE-VALUED MAX CSP.

• Authors : Jonsson, Peter¹ ; Klasson, Mikael¹ ; Krokhin, Andrei²

• Source: SIAM Journal on Computing. 2006, Vol. 35 Issue 6, p1329-1349. 21p. 1 Illustration.

تفاصيل العنوان

DECIDING REGULARITY OF THE SET OF INSTANCES OF A SET OF TERMS WITH REGULAR CONSTRAINTS IS EXPTIME-COMPLETE.

• Authors : GIMÉNEZ, OMER; GODOY, GUILLEM; MANETH, SEBASTIAN

Subjects: COMPUTATIONAL complexity; CONSTRAINT satisfaction; MATCHING theory

• Source: SIAM Journal on Computing; 2011, Vol. 40 Issue 2, p446-464, 19p

تفاصيل العنوان

AN ALMOST OPTIMAL RANK BOUND FOR DEPTH-3 IDENTITIES.

Subjects: POLYNOMIALS; SWITCHING circuits; FLIGHT recorders

• Source: SIAM Journal on Computing; 2011, Vol. 40 Issue 1, p200-224, 25p

تفاصيل العنوان

DETERMINISTIC POLYNOMIAL TIME ALGORITHMS FOR MATRIX COMPLETION PROBLEMS.

Subjects: ALGORITHMS; POLYNOMIALS; MATRICES (Mathematics)

• Source: SIAM Journal on Computing; 2010, Vol. 39 Issue 8, p3736-3751, 16p

تفاصيل العنوان

BEYOND HIRSCH CONJECTURE: WALKS ON RANDOM POLYTOPES AND SMOOTHED COMPLEXITY OF THE SIMPLEX METHOD.

• Authors : Vershynin, Roman

Subjects: MATHEMATICS; LOGICAL prediction; POLYTOPES

• Source: SIAM Journal on Computing; 2009, Vol. 39 Issue 2, p646-678, 33p, 6 Diagrams

تفاصيل العنوان

ON AGNOSTIC LEARNING OF PARITIES, MONOMIALS, AND HALFSPACES.

• Authors : Feldman, Vitaly; Gopalan, Parikshit; Khot, Subhash

Subjects: COMPUTER science; MACHINE learning; UNIFORM distribution (Probability theory)

• Source: SIAM Journal on Computing; 2009, Vol. 39 Issue 2, p606-645, 40p

تفاصيل العنوان

SPARSE ALGEBRAIC EQUATIONS OVER FINITE FIELDS.

• Authors : Semaev, Igor

Subjects: DIFFERENTIAL-algebraic equations; FINITE fields; SPARSE matrices

• Source: SIAM Journal on Computing; 2009, Vol. 39 Issue 2, p388-409, 22p, 2 Diagrams, 1 Chart

تفاصيل العنوان