COMPLEXITY CLASSES IN COMMUNICATION COMPLEXITY THEORY.

Annual Symposium on Foundations of Computer Science (Proceedings)

Volumn , Issue , 1986, Pages 337-347

  Babai, Laszlo ^a   Frankl, Peter ^a   Simon, Janos ^a  

^a EÖTVÖS LORÁND UNIVERSITY   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY; COMPUTERS - DATA COMMUNICATION SYSTEMS; COMPUTERS, MICROCOMPUTER; PROBABILITY;

COMMUNICATION COMPLEXITY (CC); COMPUTATION THEORY; NATURAL COMPLEXITY CLASSES; POLYNOMIAL TIME HIERARCHY; VLSI PROCESSORS;

AUTOMATA THEORY;

EID: 0022877553     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.1986.15     Document Type: Conference Paper

References (33)