The Library
A 2.5N LOWER BOUND ON THE MONOTONE NETWORK COMPLEXITY OF T3N
Tools
UNSPECIFIED (1985) A 2.5N LOWER BOUND ON THE MONOTONE NETWORK COMPLEXITY OF T3N. ACTA INFORMATICA, 22 (2). pp. 229-240. ISSN 0001-5903.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Item Type: | Journal Article | ||||
---|---|---|---|---|---|
Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software | ||||
Journal or Publication Title: | ACTA INFORMATICA | ||||
Publisher: | SPRINGER VERLAG | ||||
ISSN: | 0001-5903 | ||||
Official Date: | 1985 | ||||
Dates: |
|
||||
Volume: | 22 | ||||
Number: | 2 | ||||
Number of Pages: | 12 | ||||
Page Range: | pp. 229-240 | ||||
Publication Status: | Published |
Data sourced from Thomson Reuters' Web of Knowledge
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |