The Library
A 2.5N LOWER BOUND ON THE MONOTONE NETWORK COMPLEXITY OF T3N
Tools
Tools
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
Full text not available from this repository.| 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 |
| Date: | 1985 |
| Volume: | 22 |
| Number: | 2 |
| Number of Pages: | 12 |
| Page Range: | pp. 229-240 |
| Publication Status: | Published |
| URI: | http://wrap.warwick.ac.uk/id/eprint/26084 |
Data sourced from Thomson Reuters' Web of Knowledge
Actions (login required)
 |
View Item |
