Some lower and upper bounds for algebraic decision trees and the separation problem

Proceedings of the Seventh Annual Structure in Complexity Theory Conference

Volumn , Issue , 1992, Pages 295-304

  Vatan, Farrokh ^a  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; DECISION THEORY; TREES (MATHEMATICS);

DECISION TREES; SEPARATION PROBLEM;

COMPUTATIONAL COMPLEXITY;

EID: 0027067380     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)