|
|
Volumn , Issue , 1997, Pages 373-382
|
|
Linear-array problem in communication complexity resolved
|
|
Author keywords
[No Author keywords available]
|
|
Indexed keywords
BINARY CODES;
BOUNDARY CONDITIONS;
FUNCTIONS;
NETWORK PROTOCOLS;
PARALLEL PROCESSING SYSTEMS;
PROBLEM SOLVING;
PROGRAM PROCESSORS;
RANDOM PROCESSES;
THEOREM PROVING;
TURING MACHINES;
BIDIRECTIONAL LINKS;
COMMUNICATION COMPLEXITY;
COMPUTATIONAL COMPLEXITY;
|
|
EID: 0030701254
PISSN: 07349025
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1145/258533.258622 Document Type: Conference Paper |
|
Times cited : (14)
|
|
References (22)
|
