Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Heiman:1993:ROT, author = "R. Heiman and I. Newman and A. Wigderson", title = "On read-once threshold formulae and their randomized decision tree complexity", journal = j-THEOR-COMP-SCI, volume = "107", number = "1", pages = "63--76", day = "04", month = jan, year = "1993", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:15:15 MST 1997", bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Weizmann Inst. of Sci., Rehovot, Israel", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "computational complexity; constant-depth formulae; decision theory; randomized decision tree complexity; read-once threshold formulae; threshold gates; threshold logic; trees (mathematics)", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", }