Products and help bits in decision trees

This publication has 16 references indexed in Scilit:

• A direct product theorem
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Super-logarithmic depth lower bounds via direct sum in communication complexity
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Amortized communication complexity
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Some connections between bounded query classes and nonuniform complexity
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Natural proofs
  Published by Association for Computing Machinery (ACM) ,1994
• Rounds in Communication Complexity Revisited
  SIAM Journal on Computing, 1993
• On the Validity of the Direct Sum Conjecture
  SIAM Journal on Computing, 1986
• On the complexity of 2-output Boolean networks
  Theoretical Computer Science, 1981
• Realizing Boolean functions on disjoint sets of variables
  Theoretical Computer Science, 1976
• On the synthesis of self-correcting schemes from functional elements with a small number of reliable elements
  Mathematical Notes, 1974