Výsledky vyhľadávania - "Key words. boolean function complexity"

Lower Bounds on Representing Boolean Functions as Polynomials in Z m

Autori: Shi-chun Tsai The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Shi-chun Tsai The Pennsylvania State University CiteSeerX Archives

Zdroj: ftp://ftp.cs.uchicago.edu/pub/publications/tech-reports/TR-92-28.ps

Predmety: Key words. boolean function complexity, circuit complexity, computational complexity

Popis súboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.1087

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.1087

Lower Bounds on Representing Boolean Functions as Polynomials in Z_m

Autori: Shi-chun Tsai The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Shi-chun Tsai The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.csie.ncnu.edu.tw/~tsai/papers/mod-m.ps.

Predmety: Key words. boolean function complexity, circuit complexity, computational complexity

Popis súboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.2909

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.2909
http://www.csie.ncnu.edu.tw/~tsai/papers/mod-m.ps