On separating the read-k-times branching program hierarchy

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1998, Pages 653-662

  Thathachar, Jayram S ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FUNCTIONS; MATHEMATICAL MODELS; POLYNOMIALS; RANDOM PROCESSES;

BRANCHING PROGRAMS;

COMPUTATIONAL METHODS;

EID: 0031624552     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/276698.276881     Document Type: Conference Paper

References (24)