Non-linear time lower bound for Boolean branching programs

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1999, Pages 60-70

  Ajtai, Miklos ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN BRANCHING PROGRAMS; NONLINEAR TIME LOWER BOUND;

BOUNDARY CONDITIONS; GRAPH THEORY; MATHEMATICAL MODELS; MATRIX ALGEBRA; NONLINEAR SYSTEMS; PROBABILITY; THEOREM PROVING;

BOOLEAN FUNCTIONS;

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

References (5)