SlideShare a Scribd company logo
Âû÷èñëèòåëüíî òðóäíûå çàäà÷è è
              äåðàíäîìèçàöèÿ
  Ëåêöèÿ QX Åù¤ îäèí ìåòîä äîêàçàòåëüñòâà
               å
íèæíèõ îöåíîê äëÿ ñõåì îãðàíè÷åííîé ãëóáèíû

              Äìèòðèé Èöûêñîí
                  ÏÎÌÈ ÐÀÍ

                15 ìàðòà 2009


                                              1/9
 ïðîøëûé ðàç



•   Ìû ðàññìàòðèâàëè ñõåìû èç ¬ è , íåîãðàíè÷åííîé
    âõîäíîé ñòåïåíè.
•   Äîêàçàëè: ñõåìà êîíñòàíòíîé ãëóáèíû, ðåøàþùàÿ Parity
    èìååò ñóïåðïîëèíîìèàëüíûé ðàçìåð.
•   Äîêàçàòåëüñòâî ïðîõîäèò äëÿ ëþáîé ôóíêöèè, êîòîðàÿ íå
    îáðàùàåòñÿ â êîíñòàíòó ïðè ïîäñòàíîâêå çíà÷åíèé ÷àñòè
    ïåðåìåííûì.
•   À åñëè ðàçðåøèòü èñïîëüçîâàòü â ñõåìå ?



                                                            2/9
Ñåãîäíÿ




                                   0, x1 + x2 + · · · + xn = 0 mod p
                                                     èíà÷å
• MODp (x1 , x2 , . . . , xn ) =
                                   1,
•   Òåîðåìà. (Ðàçáîðîâ, Ñìîëåíñêèé) Åñëè p, q ∈ P, p = q, òî
    ëþáàÿ ñõåìà êîíñòàíòíîé ãëóáèíû èç ¬, , , MODp ,
    âû÷èñëÿþùàÿ MODq , èìååò ýêñïîíåíöèàëüíûé ðàçìåð.
•   Äëÿ ïðîñòîòû ñ÷èòàåì: q = 2, p = 3.




                                                                       3/9
Ïëàí äîêàçàòåëüñòâà



1   Ïðèáëèçèòü ñõåìó C ðàçìåðà S ìíîãî÷ëåíîì îò n
    ïåðåìåííûõ:            √
      •   Ñòåïåíü ìíîãî÷ëåíà       ≤   n/2
      •   Çíà÷åíèå ìíîãî÷ëåíà ñîâïàäàåò ñî çíà÷åíèÿìè   C   íà äîëå
                     c
          1 − S/2n       âõîäîâ.

2   Ïîêàçàòü, ÷òî ìíîãî÷ëåí ñòåïåíè ≤ √n/2 íå ìîæåò
    ñîâïàäàòü ñ MOD2 áîëåå, ÷åì íà 50 äîëå âõîäîâ.
                                    49

3   Ñëåäñòâèå: S ≥ 2n /50.   c




                                                                      4/9
Ïðèáëèæåíèå ìíîãî÷ëåíàìè

•   Ãåéò g íà ãëóáèíå h ìû ïðèáëèæàåì ìíîãî÷ëåíîì
    g (x1 , x2 , . . . , xn ) íàä ïîëåì Z3 ñòåïåíè l h (l > 2  âûáåðåì
    ˜
    ïîçæå).
•   Òðåáóåì, ÷òîáû íà {0, 1}n çíà÷åíèÿ áûëè áû èç {0, 1}.
    (Äîñòàòî÷íî âîçâåñòè â êâàäðàò).
•   Åñëè g  ýòî âõîä ñõåìû, òî g = xi .  ˜
•   Åñëè g = ¬f , òî g = 1 − f ˜      ˜.
•   Åñëè g = MOD3(f1, f2, . . . , fk ), òî g = (f˜1 + f˜2 + · · · + f˜k )2.
                                              ˜
    Ñòåïåíü 2l       h  l h+1 .

•   Åñëè g = k fi , òî õî÷åòñÿ ïðèáëèçèòü òàê: g = k f˜i .  ˜
    Íî ñòåïåíü óâåëè÷èâàåòñÿ â k ðàç!!!
                        i=1                                        i=1




                                                                              5/9
Ïðèáëèæåíèå               è
•   Îïèøåì ïðèáëèæåíèå äëÿ (äëÿ  àíàëîãè÷íî ïî
    ïðàâèëàì äå Ìîðãàíà)
•   g = k fi .
          i=1
•   Âûáåðåì ñëó÷àéíîå ïîäìíîæåñòâî A ⊆ {1, 2, . . . , k}.
                    k
      •   Åñëè
                    i=1 fi   = 1,   òî   Pr[(    i∈A fi )
                                                         2
                                                             = 1] ≥ 1 .
                                                                    2
                    k                                    2
      •   Åñëè
                    i=1 fi   = 0,   òî   Pr[(    i∈A fi )    = 0] = 1.
•   Âûáåðåì ñëó÷àéíûå A1, A2, . . . , Al/2 ⊆ {1, 2, . . . , k}.
    g = 1 − j=1 (1 − ( i∈A fi )2 ), deg g ≤ 2 2(l)h−1 = l h .
               l/2           ˜                l
•   ˜                                    ˜j

    ∀x Prr [îøèáêà]  1/2 =⇒ Prx,r [îøèáêà]  1/2 =⇒
                                    l                                     l
•                                   2                                     2

    ∃r Prx [îøèáêà]  1/2 .
                                    l
                                    2


•   Îøèáêà íà ñõåìå ðàçìåðà S : ≤ S/2                        l
                                                             2

    l = ( n/2)1/d : ïîëèíîì ñòåïåíè n/2, îøèáêà:
         √                             √
•
           1/(2d) /21+1/d
    S/2n
                                                                              6/9
Ïðèáëèæåíèå MOD2 ìíîãî÷ëåíàìè

Òåîðåìà. Ìíîãî÷ëåí f èç Z3[x1, x2, . . . , xn√ ñîãëàñóåòñÿ ñ MOD2
                                             ]
íà ìíîæåñòâå G ⊆ {0, 1}n . Åñëè deg f ≤ n/2, òî |G |  49 2n
Äîêàçàòåëüñòâî.
                                                              50


  • Çàìåíà ïåðåìåííûõ: yi = 1 + xi mod 3. (0 → 1, 1 → −1,
    G → G ⊆ {−1, 1}n , f → g , deg g = deg f ≤ n/2)
                                                    √
                                               n
                                      1 =⇒         yi = −1
                                     
                                     
                                     
                                     
                                               i=1
  • MOD2 (x1 , x2 , . . . , xn ) =                n
                                     
                                     
                                      0, =⇒
                                                     yi = 1
                                     
                                                i=1
  •   Èòîãî, g (y1, y2, . . . , yn ) nýòî ìíîãî÷ëåí ñòåïåíè √n/2,
      êîòîðûé ñîãëàñóåòñÿ ñ i=1 yi íà G .

                                                                     7/9
Ïðèáëèæåíèå MOD2 ìíîãî÷ëåíàìè

  • FG   ýòî ìíîæåñòâî âñåõ ôóíêöèé èç G → {0, 1, −1}.
  • |FG | = 3|G | .
  • Äîñòàòî÷íî ïîêàçàòü: |FG |  3( )2 .
                                   49   n
                                   50


Ëåììà. Êàæäàÿ ôóíêöèÿ s ∈ FG ïðåäñòàâëÿåòñÿ â âèäå ñóììû
ìîíîìîâ âèäà aI i∈I yi , ãäå |I | ≤ n + √n/2.
Äîêàçàòåëüñòâî.
                                        2


  • Ïðåäñòàâèì s â âèäå ìíîãî÷ëåíà.
  • Ïîñêîëüêó âõîäû èç G , òî yi2 = 1, ò.å. s ëèíååí ïî êàæäîé
    ïåðåìåííîé.
  • Ïóñòü â s åñòü ìîíîì i∈I yi , â êîòîðîì |I |  n/2.

                                               i∈[n]I yi .
                    n
  •   i∈I yi =      i=1 yi i∈[n]I yi = g (y )

Ñëåäñòâèå. |FG | ≤ 3÷èñëî ìîíîìîâ = 3C +C +···+C
                                                     n +√n/2
                                            1   2    2
                                            n   n   n



                                                                 8/9
n √
                                                                                   2 + n/2
                           Îöåíêà         1
                                         Cn       +      2
                                                        Cn    + · · · + Cn
                                                                          √
Îñòàëîñü ïîêàçàòü, ÷òî Cn1 + Cn2 + · · · + Cn + n/2  49 2n .
                                                                      n
                                                                      2
                                                      50
                         √                         √
  • Ôîðìóëà Ñòèðëèíãà: 2 · 3.14n n  n!  2 · 3.15n n
                                          n                                                      n
                                        e                     e
  •
                                  √                     n n
           n
           2
                      n!              2 · 3.15n         e                 2n
        Cn =                                             n   =
                     n 2                          n/2                      3.14
                                                                      n/2 √3.15
                     2!           3.14n            e
                                                                           2n             2n
                                                                                   =√
                                                                           n 3.16        1.58n
                                                                              2

                                  n    √                          √
     1    2                           + n/2                        n n/2
  • Cn + Cn + · · · + Cn2                          2n−1 +        2 Cn         
           1
      2n ( 2   +    √1
                   2 1.58
                          )      49
                                  50     2n   .

                                                                                                     9/9

More Related Content

What's hot

Лекция 10 - Схемы разделения секрета. Жизненный цикл ключей
Лекция 10 - Схемы разделения секрета. Жизненный цикл ключейЛекция 10 - Схемы разделения секрета. Жизненный цикл ключей
Лекция 10 - Схемы разделения секрета. Жизненный цикл ключейMikhail Buryakov
 
Хязгаарыг бодох
Хязгаарыг бодохХязгаарыг бодох
Хязгаарыг бодох
Battur
 
20100930 proof complexity_hirsch_lecture03
20100930 proof complexity_hirsch_lecture0320100930 proof complexity_hirsch_lecture03
20100930 proof complexity_hirsch_lecture03Computer Science Club
 
Thue 8
Thue 8Thue 8
PropuestanSolucionario 6 por David Hoyos y Andres Mella
PropuestanSolucionario 6 por David Hoyos y Andres MellaPropuestanSolucionario 6 por David Hoyos y Andres Mella
PropuestanSolucionario 6 por David Hoyos y Andres MellaDavid Steven Hoyos Gil
 
Підручник Математика 4 клас Г.П. Лишенко (2021 рік) Частина 1
Підручник Математика 4 клас Г.П. Лишенко (2021 рік) Частина 1Підручник Математика 4 клас Г.П. Лишенко (2021 рік) Частина 1
Підручник Математика 4 клас Г.П. Лишенко (2021 рік) Частина 1
12Балів ГДЗ
 
20100930 proof complexity_hirsch_lecture03
20100930 proof complexity_hirsch_lecture0320100930 proof complexity_hirsch_lecture03
20100930 proof complexity_hirsch_lecture03Computer Science Club
 
đồ áN kết cấu thép nhà công nghiệp nhịp 30m
đồ áN kết cấu thép nhà công nghiệp nhịp 30mđồ áN kết cấu thép nhà công nghiệp nhịp 30m
đồ áN kết cấu thép nhà công nghiệp nhịp 30m
jackjohn45
 
phuong trinh vi phan d geometry
phuong trinh vi phan d geometryphuong trinh vi phan d geometry
phuong trinh vi phan d geometry
Bui Loi
 
Toan dh aa1_ct_14_da_2
Toan dh aa1_ct_14_da_2Toan dh aa1_ct_14_da_2
Toan dh aa1_ct_14_da_2dominhvuong
 
Dap an toan a a1 dh2014
Dap an toan a a1 dh2014Dap an toan a a1 dh2014
Dap an toan a a1 dh2014
Học Tập Long An
 

What's hot (15)

Лекция 10 - Схемы разделения секрета. Жизненный цикл ключей
Лекция 10 - Схемы разделения секрета. Жизненный цикл ключейЛекция 10 - Схемы разделения секрета. Жизненный цикл ключей
Лекция 10 - Схемы разделения секрета. Жизненный цикл ключей
 
20091115 mfcs itsykson_lecture07
20091115 mfcs itsykson_lecture0720091115 mfcs itsykson_lecture07
20091115 mfcs itsykson_lecture07
 
Хязгаарыг бодох
Хязгаарыг бодохХязгаарыг бодох
Хязгаарыг бодох
 
20100930 proof complexity_hirsch_lecture03
20100930 proof complexity_hirsch_lecture0320100930 proof complexity_hirsch_lecture03
20100930 proof complexity_hirsch_lecture03
 
Thue 8
Thue 8Thue 8
Thue 8
 
20091206 mfcs itsykson_lecture08
20091206 mfcs itsykson_lecture0820091206 mfcs itsykson_lecture08
20091206 mfcs itsykson_lecture08
 
PropuestanSolucionario 6 por David Hoyos y Andres Mella
PropuestanSolucionario 6 por David Hoyos y Andres MellaPropuestanSolucionario 6 por David Hoyos y Andres Mella
PropuestanSolucionario 6 por David Hoyos y Andres Mella
 
Підручник Математика 4 клас Г.П. Лишенко (2021 рік) Частина 1
Підручник Математика 4 клас Г.П. Лишенко (2021 рік) Частина 1Підручник Математика 4 клас Г.П. Лишенко (2021 рік) Частина 1
Підручник Математика 4 клас Г.П. Лишенко (2021 рік) Частина 1
 
123445566
123445566123445566
123445566
 
Biedaalt
BiedaaltBiedaalt
Biedaalt
 
20100930 proof complexity_hirsch_lecture03
20100930 proof complexity_hirsch_lecture0320100930 proof complexity_hirsch_lecture03
20100930 proof complexity_hirsch_lecture03
 
đồ áN kết cấu thép nhà công nghiệp nhịp 30m
đồ áN kết cấu thép nhà công nghiệp nhịp 30mđồ áN kết cấu thép nhà công nghiệp nhịp 30m
đồ áN kết cấu thép nhà công nghiệp nhịp 30m
 
phuong trinh vi phan d geometry
phuong trinh vi phan d geometryphuong trinh vi phan d geometry
phuong trinh vi phan d geometry
 
Toan dh aa1_ct_14_da_2
Toan dh aa1_ct_14_da_2Toan dh aa1_ct_14_da_2
Toan dh aa1_ct_14_da_2
 
Dap an toan a a1 dh2014
Dap an toan a a1 dh2014Dap an toan a a1 dh2014
Dap an toan a a1 dh2014
 

Viewers also liked

One piece volume 36(337-346)
One piece volume 36(337-346)One piece volume 36(337-346)
One piece volume 36(337-346)
Marcos Donato
 
Certificado Impacta Tecnologia
Certificado Impacta TecnologiaCertificado Impacta Tecnologia
Certificado Impacta TecnologiaRubens Jr
 
Fotos de pernos
Fotos de pernosFotos de pernos
Fotos de pernos
Empresa Nahuel
 
Logo Strijckers&Baadjou
Logo Strijckers&BaadjouLogo Strijckers&Baadjou
Logo Strijckers&BaadjouMarcBaadjou
 
Distributed and Parallel Architecture, from grid to MapReduce, hadoop
Distributed and Parallel Architecture, from grid to MapReduce, hadoopDistributed and Parallel Architecture, from grid to MapReduce, hadoop
Distributed and Parallel Architecture, from grid to MapReduce, hadoop
Paolo Nesi
 
Solution
SolutionSolution
Solution
Diego Pacheco
 
Nueva ley de delitos informaticos
Nueva ley de delitos informaticosNueva ley de delitos informaticos
Nueva ley de delitos informaticos
CYNTIA
 
Unidad educativa municipal quitumbe
Unidad educativa municipal  quitumbeUnidad educativa municipal  quitumbe
Unidad educativa municipal quitumbeSteven Lalvay
 
Mobiilioppiminen laajennetussa työssäoppimisessa
Mobiilioppiminen laajennetussa työssäoppimisessaMobiilioppiminen laajennetussa työssäoppimisessa
Mobiilioppiminen laajennetussa työssäoppimisessaPauliina Venho
 
No al cyberbullying
No al cyberbullyingNo al cyberbullying
No al cyberbullyingximedonoso
 
Vani_Gaddamidi_Administrator
Vani_Gaddamidi_AdministratorVani_Gaddamidi_Administrator
Vani_Gaddamidi_AdministratorVani Gaddamidi
 
20090222 parallel programming_lecture01-07
20090222 parallel programming_lecture01-0720090222 parallel programming_lecture01-07
20090222 parallel programming_lecture01-07Computer Science Club
 
Cursos de forex para novatos
Cursos de forex para novatosCursos de forex para novatos
Cursos de forex para novatos
cfcarmen250
 
Físico-Química 3º año: Guía La estructura del átomo.
Físico-Química 3º año: Guía La estructura del átomo.Físico-Química 3º año: Guía La estructura del átomo.
Físico-Química 3º año: Guía La estructura del átomo.
Cecilia Fernandez Castro
 
Tourplace2013: Как самостоятельно провести юзабилити-тестирование (на примере...
Tourplace2013: Как самостоятельно провести юзабилити-тестирование (на примере...Tourplace2013: Как самостоятельно провести юзабилити-тестирование (на примере...
Tourplace2013: Как самостоятельно провести юзабилити-тестирование (на примере...
Maria Chaykina
 
One piece volume 43(410-419)
One piece volume 43(410-419)One piece volume 43(410-419)
One piece volume 43(410-419)
Marcos Donato
 
Politisk kommunikasjon med ny teknologi
Politisk kommunikasjon med ny teknologiPolitisk kommunikasjon med ny teknologi
Politisk kommunikasjon med ny teknologiBente Kalsnes
 
L'equitatcomacamíal'excelència
L'equitatcomacamíal'excelènciaL'equitatcomacamíal'excelència
L'equitatcomacamíal'excelènciaemmsantboi
 
Beautiful Data Visualisation & D3
Beautiful Data Visualisation & D3Beautiful Data Visualisation & D3
Beautiful Data Visualisation & D3
Robin Hawkes
 

Viewers also liked (20)

One piece volume 36(337-346)
One piece volume 36(337-346)One piece volume 36(337-346)
One piece volume 36(337-346)
 
Certificado Impacta Tecnologia
Certificado Impacta TecnologiaCertificado Impacta Tecnologia
Certificado Impacta Tecnologia
 
Fotos de pernos
Fotos de pernosFotos de pernos
Fotos de pernos
 
Logo Strijckers&Baadjou
Logo Strijckers&BaadjouLogo Strijckers&Baadjou
Logo Strijckers&Baadjou
 
Distributed and Parallel Architecture, from grid to MapReduce, hadoop
Distributed and Parallel Architecture, from grid to MapReduce, hadoopDistributed and Parallel Architecture, from grid to MapReduce, hadoop
Distributed and Parallel Architecture, from grid to MapReduce, hadoop
 
Solution
SolutionSolution
Solution
 
Nueva ley de delitos informaticos
Nueva ley de delitos informaticosNueva ley de delitos informaticos
Nueva ley de delitos informaticos
 
Unidad educativa municipal quitumbe
Unidad educativa municipal  quitumbeUnidad educativa municipal  quitumbe
Unidad educativa municipal quitumbe
 
Mobiilioppiminen laajennetussa työssäoppimisessa
Mobiilioppiminen laajennetussa työssäoppimisessaMobiilioppiminen laajennetussa työssäoppimisessa
Mobiilioppiminen laajennetussa työssäoppimisessa
 
No al cyberbullying
No al cyberbullyingNo al cyberbullying
No al cyberbullying
 
Vani_Gaddamidi_Administrator
Vani_Gaddamidi_AdministratorVani_Gaddamidi_Administrator
Vani_Gaddamidi_Administrator
 
20090222 parallel programming_lecture01-07
20090222 parallel programming_lecture01-0720090222 parallel programming_lecture01-07
20090222 parallel programming_lecture01-07
 
Cursos de forex para novatos
Cursos de forex para novatosCursos de forex para novatos
Cursos de forex para novatos
 
Físico-Química 3º año: Guía La estructura del átomo.
Físico-Química 3º año: Guía La estructura del átomo.Físico-Química 3º año: Guía La estructura del átomo.
Físico-Química 3º año: Guía La estructura del átomo.
 
Tourplace2013: Как самостоятельно провести юзабилити-тестирование (на примере...
Tourplace2013: Как самостоятельно провести юзабилити-тестирование (на примере...Tourplace2013: Как самостоятельно провести юзабилити-тестирование (на примере...
Tourplace2013: Как самостоятельно провести юзабилити-тестирование (на примере...
 
Spring Capitulo 04
Spring Capitulo 04Spring Capitulo 04
Spring Capitulo 04
 
One piece volume 43(410-419)
One piece volume 43(410-419)One piece volume 43(410-419)
One piece volume 43(410-419)
 
Politisk kommunikasjon med ny teknologi
Politisk kommunikasjon med ny teknologiPolitisk kommunikasjon med ny teknologi
Politisk kommunikasjon med ny teknologi
 
L'equitatcomacamíal'excelència
L'equitatcomacamíal'excelènciaL'equitatcomacamíal'excelència
L'equitatcomacamíal'excelència
 
Beautiful Data Visualisation & D3
Beautiful Data Visualisation & D3Beautiful Data Visualisation & D3
Beautiful Data Visualisation & D3
 

More from Computer Science Club

20141223 kuznetsov distributed
20141223 kuznetsov distributed20141223 kuznetsov distributed
20141223 kuznetsov distributed
Computer Science Club
 
Computer Vision
Computer VisionComputer Vision
Computer Vision
Computer Science Club
 
20140531 serebryany lecture01_fantastic_cpp_bugs
20140531 serebryany lecture01_fantastic_cpp_bugs20140531 serebryany lecture01_fantastic_cpp_bugs
20140531 serebryany lecture01_fantastic_cpp_bugsComputer Science Club
 
20140531 serebryany lecture02_find_scary_cpp_bugs
20140531 serebryany lecture02_find_scary_cpp_bugs20140531 serebryany lecture02_find_scary_cpp_bugs
20140531 serebryany lecture02_find_scary_cpp_bugsComputer Science Club
 
20140531 serebryany lecture01_fantastic_cpp_bugs
20140531 serebryany lecture01_fantastic_cpp_bugs20140531 serebryany lecture01_fantastic_cpp_bugs
20140531 serebryany lecture01_fantastic_cpp_bugsComputer Science Club
 
20140511 parallel programming_kalishenko_lecture12
20140511 parallel programming_kalishenko_lecture1220140511 parallel programming_kalishenko_lecture12
20140511 parallel programming_kalishenko_lecture12Computer Science Club
 
20140427 parallel programming_zlobin_lecture11
20140427 parallel programming_zlobin_lecture1120140427 parallel programming_zlobin_lecture11
20140427 parallel programming_zlobin_lecture11Computer Science Club
 
20140420 parallel programming_kalishenko_lecture10
20140420 parallel programming_kalishenko_lecture1020140420 parallel programming_kalishenko_lecture10
20140420 parallel programming_kalishenko_lecture10Computer Science Club
 
20140413 parallel programming_kalishenko_lecture09
20140413 parallel programming_kalishenko_lecture0920140413 parallel programming_kalishenko_lecture09
20140413 parallel programming_kalishenko_lecture09Computer Science Club
 
20140329 graph drawing_dainiak_lecture02
20140329 graph drawing_dainiak_lecture0220140329 graph drawing_dainiak_lecture02
20140329 graph drawing_dainiak_lecture02Computer Science Club
 
20140329 graph drawing_dainiak_lecture01
20140329 graph drawing_dainiak_lecture0120140329 graph drawing_dainiak_lecture01
20140329 graph drawing_dainiak_lecture01Computer Science Club
 
20140310 parallel programming_kalishenko_lecture03-04
20140310 parallel programming_kalishenko_lecture03-0420140310 parallel programming_kalishenko_lecture03-04
20140310 parallel programming_kalishenko_lecture03-04Computer Science Club
 
20140216 parallel programming_kalishenko_lecture01
20140216 parallel programming_kalishenko_lecture0120140216 parallel programming_kalishenko_lecture01
20140216 parallel programming_kalishenko_lecture01Computer Science Club
 

More from Computer Science Club (20)

20141223 kuznetsov distributed
20141223 kuznetsov distributed20141223 kuznetsov distributed
20141223 kuznetsov distributed
 
Computer Vision
Computer VisionComputer Vision
Computer Vision
 
20140531 serebryany lecture01_fantastic_cpp_bugs
20140531 serebryany lecture01_fantastic_cpp_bugs20140531 serebryany lecture01_fantastic_cpp_bugs
20140531 serebryany lecture01_fantastic_cpp_bugs
 
20140531 serebryany lecture02_find_scary_cpp_bugs
20140531 serebryany lecture02_find_scary_cpp_bugs20140531 serebryany lecture02_find_scary_cpp_bugs
20140531 serebryany lecture02_find_scary_cpp_bugs
 
20140531 serebryany lecture01_fantastic_cpp_bugs
20140531 serebryany lecture01_fantastic_cpp_bugs20140531 serebryany lecture01_fantastic_cpp_bugs
20140531 serebryany lecture01_fantastic_cpp_bugs
 
20140511 parallel programming_kalishenko_lecture12
20140511 parallel programming_kalishenko_lecture1220140511 parallel programming_kalishenko_lecture12
20140511 parallel programming_kalishenko_lecture12
 
20140427 parallel programming_zlobin_lecture11
20140427 parallel programming_zlobin_lecture1120140427 parallel programming_zlobin_lecture11
20140427 parallel programming_zlobin_lecture11
 
20140420 parallel programming_kalishenko_lecture10
20140420 parallel programming_kalishenko_lecture1020140420 parallel programming_kalishenko_lecture10
20140420 parallel programming_kalishenko_lecture10
 
20140413 parallel programming_kalishenko_lecture09
20140413 parallel programming_kalishenko_lecture0920140413 parallel programming_kalishenko_lecture09
20140413 parallel programming_kalishenko_lecture09
 
20140329 graph drawing_dainiak_lecture02
20140329 graph drawing_dainiak_lecture0220140329 graph drawing_dainiak_lecture02
20140329 graph drawing_dainiak_lecture02
 
20140329 graph drawing_dainiak_lecture01
20140329 graph drawing_dainiak_lecture0120140329 graph drawing_dainiak_lecture01
20140329 graph drawing_dainiak_lecture01
 
20140310 parallel programming_kalishenko_lecture03-04
20140310 parallel programming_kalishenko_lecture03-0420140310 parallel programming_kalishenko_lecture03-04
20140310 parallel programming_kalishenko_lecture03-04
 
20140223-SuffixTrees-lecture01-03
20140223-SuffixTrees-lecture01-0320140223-SuffixTrees-lecture01-03
20140223-SuffixTrees-lecture01-03
 
20140216 parallel programming_kalishenko_lecture01
20140216 parallel programming_kalishenko_lecture0120140216 parallel programming_kalishenko_lecture01
20140216 parallel programming_kalishenko_lecture01
 
20131106 h10 lecture6_matiyasevich
20131106 h10 lecture6_matiyasevich20131106 h10 lecture6_matiyasevich
20131106 h10 lecture6_matiyasevich
 
20131027 h10 lecture5_matiyasevich
20131027 h10 lecture5_matiyasevich20131027 h10 lecture5_matiyasevich
20131027 h10 lecture5_matiyasevich
 
20131027 h10 lecture5_matiyasevich
20131027 h10 lecture5_matiyasevich20131027 h10 lecture5_matiyasevich
20131027 h10 lecture5_matiyasevich
 
20131013 h10 lecture4_matiyasevich
20131013 h10 lecture4_matiyasevich20131013 h10 lecture4_matiyasevich
20131013 h10 lecture4_matiyasevich
 
20131006 h10 lecture3_matiyasevich
20131006 h10 lecture3_matiyasevich20131006 h10 lecture3_matiyasevich
20131006 h10 lecture3_matiyasevich
 
20131006 h10 lecture3_matiyasevich
20131006 h10 lecture3_matiyasevich20131006 h10 lecture3_matiyasevich
20131006 h10 lecture3_matiyasevich
 

20090315 hardnessvsrandomness itsykson_lecture03

  • 1. Âû÷èñëèòåëüíî òðóäíûå çàäà÷è è äåðàíäîìèçàöèÿ Ëåêöèÿ QX Åù¤ îäèí ìåòîä äîêàçàòåëüñòâà å íèæíèõ îöåíîê äëÿ ñõåì îãðàíè÷åííîé ãëóáèíû Äìèòðèé Èöûêñîí ÏÎÌÈ ÐÀÍ 15 ìàðòà 2009 1/9
  • 2.  ïðîøëûé ðàç • Ìû ðàññìàòðèâàëè ñõåìû èç ¬ è , íåîãðàíè÷åííîé âõîäíîé ñòåïåíè. • Äîêàçàëè: ñõåìà êîíñòàíòíîé ãëóáèíû, ðåøàþùàÿ Parity èìååò ñóïåðïîëèíîìèàëüíûé ðàçìåð. • Äîêàçàòåëüñòâî ïðîõîäèò äëÿ ëþáîé ôóíêöèè, êîòîðàÿ íå îáðàùàåòñÿ â êîíñòàíòó ïðè ïîäñòàíîâêå çíà÷åíèé ÷àñòè ïåðåìåííûì. • À åñëè ðàçðåøèòü èñïîëüçîâàòü â ñõåìå ? 2/9
  • 3. Ñåãîäíÿ 0, x1 + x2 + · · · + xn = 0 mod p èíà÷å • MODp (x1 , x2 , . . . , xn ) = 1, • Òåîðåìà. (Ðàçáîðîâ, Ñìîëåíñêèé) Åñëè p, q ∈ P, p = q, òî ëþáàÿ ñõåìà êîíñòàíòíîé ãëóáèíû èç ¬, , , MODp , âû÷èñëÿþùàÿ MODq , èìååò ýêñïîíåíöèàëüíûé ðàçìåð. • Äëÿ ïðîñòîòû ñ÷èòàåì: q = 2, p = 3. 3/9
  • 4. Ïëàí äîêàçàòåëüñòâà 1 Ïðèáëèçèòü ñõåìó C ðàçìåðà S ìíîãî÷ëåíîì îò n ïåðåìåííûõ: √ • Ñòåïåíü ìíîãî÷ëåíà ≤ n/2 • Çíà÷åíèå ìíîãî÷ëåíà ñîâïàäàåò ñî çíà÷åíèÿìè C íà äîëå c 1 − S/2n âõîäîâ. 2 Ïîêàçàòü, ÷òî ìíîãî÷ëåí ñòåïåíè ≤ √n/2 íå ìîæåò ñîâïàäàòü ñ MOD2 áîëåå, ÷åì íà 50 äîëå âõîäîâ. 49 3 Ñëåäñòâèå: S ≥ 2n /50. c 4/9
  • 5. Ïðèáëèæåíèå ìíîãî÷ëåíàìè • Ãåéò g íà ãëóáèíå h ìû ïðèáëèæàåì ìíîãî÷ëåíîì g (x1 , x2 , . . . , xn ) íàä ïîëåì Z3 ñòåïåíè l h (l > 2 âûáåðåì ˜ ïîçæå). • Òðåáóåì, ÷òîáû íà {0, 1}n çíà÷åíèÿ áûëè áû èç {0, 1}. (Äîñòàòî÷íî âîçâåñòè â êâàäðàò). • Åñëè g ýòî âõîä ñõåìû, òî g = xi . ˜ • Åñëè g = ¬f , òî g = 1 − f ˜ ˜. • Åñëè g = MOD3(f1, f2, . . . , fk ), òî g = (f˜1 + f˜2 + · · · + f˜k )2. ˜ Ñòåïåíü 2l h l h+1 . • Åñëè g = k fi , òî õî÷åòñÿ ïðèáëèçèòü òàê: g = k f˜i . ˜ Íî ñòåïåíü óâåëè÷èâàåòñÿ â k ðàç!!! i=1 i=1 5/9
  • 6. Ïðèáëèæåíèå è • Îïèøåì ïðèáëèæåíèå äëÿ (äëÿ àíàëîãè÷íî ïî ïðàâèëàì äå Ìîðãàíà) • g = k fi . i=1 • Âûáåðåì ñëó÷àéíîå ïîäìíîæåñòâî A ⊆ {1, 2, . . . , k}. k • Åñëè i=1 fi = 1, òî Pr[( i∈A fi ) 2 = 1] ≥ 1 . 2 k 2 • Åñëè i=1 fi = 0, òî Pr[( i∈A fi ) = 0] = 1. • Âûáåðåì ñëó÷àéíûå A1, A2, . . . , Al/2 ⊆ {1, 2, . . . , k}. g = 1 − j=1 (1 − ( i∈A fi )2 ), deg g ≤ 2 2(l)h−1 = l h . l/2 ˜ l • ˜ ˜j ∀x Prr [îøèáêà] 1/2 =⇒ Prx,r [îøèáêà] 1/2 =⇒ l l • 2 2 ∃r Prx [îøèáêà] 1/2 . l 2 • Îøèáêà íà ñõåìå ðàçìåðà S : ≤ S/2 l 2 l = ( n/2)1/d : ïîëèíîì ñòåïåíè n/2, îøèáêà: √ √ • 1/(2d) /21+1/d S/2n 6/9
  • 7. Ïðèáëèæåíèå MOD2 ìíîãî÷ëåíàìè Òåîðåìà. Ìíîãî÷ëåí f èç Z3[x1, x2, . . . , xn√ ñîãëàñóåòñÿ ñ MOD2 ] íà ìíîæåñòâå G ⊆ {0, 1}n . Åñëè deg f ≤ n/2, òî |G | 49 2n Äîêàçàòåëüñòâî. 50 • Çàìåíà ïåðåìåííûõ: yi = 1 + xi mod 3. (0 → 1, 1 → −1, G → G ⊆ {−1, 1}n , f → g , deg g = deg f ≤ n/2) √  n  1 =⇒ yi = −1     i=1 • MOD2 (x1 , x2 , . . . , xn ) = n    0, =⇒  yi = 1  i=1 • Èòîãî, g (y1, y2, . . . , yn ) nýòî ìíîãî÷ëåí ñòåïåíè √n/2, êîòîðûé ñîãëàñóåòñÿ ñ i=1 yi íà G . 7/9
  • 8. Ïðèáëèæåíèå MOD2 ìíîãî÷ëåíàìè • FG ýòî ìíîæåñòâî âñåõ ôóíêöèé èç G → {0, 1, −1}. • |FG | = 3|G | . • Äîñòàòî÷íî ïîêàçàòü: |FG | 3( )2 . 49 n 50 Ëåììà. Êàæäàÿ ôóíêöèÿ s ∈ FG ïðåäñòàâëÿåòñÿ â âèäå ñóììû ìîíîìîâ âèäà aI i∈I yi , ãäå |I | ≤ n + √n/2. Äîêàçàòåëüñòâî. 2 • Ïðåäñòàâèì s â âèäå ìíîãî÷ëåíà. • Ïîñêîëüêó âõîäû èç G , òî yi2 = 1, ò.å. s ëèíååí ïî êàæäîé ïåðåìåííîé. • Ïóñòü â s åñòü ìîíîì i∈I yi , â êîòîðîì |I | n/2. i∈[n]I yi . n • i∈I yi = i=1 yi i∈[n]I yi = g (y ) Ñëåäñòâèå. |FG | ≤ 3÷èñëî ìîíîìîâ = 3C +C +···+C n +√n/2 1 2 2 n n n 8/9
  • 9. n √ 2 + n/2 Îöåíêà 1 Cn + 2 Cn + · · · + Cn √ Îñòàëîñü ïîêàçàòü, ÷òî Cn1 + Cn2 + · · · + Cn + n/2 49 2n . n 2 50 √ √ • Ôîðìóëà Ñòèðëèíãà: 2 · 3.14n n n! 2 · 3.15n n n n e e • √ n n n 2 n! 2 · 3.15n e 2n Cn = n = n 2 n/2 3.14 n/2 √3.15 2! 3.14n e 2n 2n =√ n 3.16 1.58n 2 n √ √ 1 2 + n/2 n n/2 • Cn + Cn + · · · + Cn2 2n−1 + 2 Cn 1 2n ( 2 + √1 2 1.58 ) 49 50 2n . 9/9