File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/0022-0000(92)90025-E
- Scopus: eid_2-s2.0-0026853225
- WOS: WOS:A1992HR25000009
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Results on communication complexity classes
| Title | Results on communication complexity classes |
|---|---|
| Authors | |
| Issue Date | 1992 |
| Publisher | Academic Press. The Journal's web site is located at http://www.elsevier.com/locate/jcss |
| Citation | Journal Of Computer And System Sciences, 1992, v. 44 n. 2, p. 324-342 How to Cite? |
| Abstract | Deterministic, probabilistic, nondeterministic, and alternating complexity classes defined by polylogarithmic communication are considered. Main results are (1) extending work of Ja'Ja', Prasanna Kumar, and Simon, we give a simple technique allowing translation of most known separation and containment results for complexity classes of the fixed partition model to the more difficult optimal partition model, where few results were previously known; and (2) demonstration that a certain natural language (block-equality) in ∑2 CC is also, unexpectedly, in π2 CC. |
| Persistent Identifier | http://hdl.handle.net/10722/152233 |
| ISSN | 2023 Impact Factor: 1.1 2023 SCImago Journal Rankings: 1.370 |
| ISI Accession Number ID |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Lam, TW | en_US |
| dc.date.accessioned | 2012-06-26T06:36:39Z | - |
| dc.date.available | 2012-06-26T06:36:39Z | - |
| dc.date.issued | 1992 | en_US |
| dc.identifier.citation | Journal Of Computer And System Sciences, 1992, v. 44 n. 2, p. 324-342 | en_US |
| dc.identifier.issn | 0022-0000 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10722/152233 | - |
| dc.description.abstract | Deterministic, probabilistic, nondeterministic, and alternating complexity classes defined by polylogarithmic communication are considered. Main results are (1) extending work of Ja'Ja', Prasanna Kumar, and Simon, we give a simple technique allowing translation of most known separation and containment results for complexity classes of the fixed partition model to the more difficult optimal partition model, where few results were previously known; and (2) demonstration that a certain natural language (block-equality) in ∑2 CC is also, unexpectedly, in π2 CC. | en_US |
| dc.language | eng | en_US |
| dc.publisher | Academic Press. The Journal's web site is located at http://www.elsevier.com/locate/jcss | en_US |
| dc.relation.ispartof | Journal of Computer and System Sciences | en_US |
| dc.title | Results on communication complexity classes | en_US |
| dc.type | Article | en_US |
| dc.identifier.email | Lam, TW:twlam@cs.hku.hk | en_US |
| dc.identifier.authority | Lam, TW=rp00135 | en_US |
| dc.description.nature | link_to_subscribed_fulltext | en_US |
| dc.identifier.doi | 10.1016/0022-0000(92)90025-E | en_US |
| dc.identifier.scopus | eid_2-s2.0-0026853225 | en_US |
| dc.identifier.volume | 44 | en_US |
| dc.identifier.issue | 2 | en_US |
| dc.identifier.spage | 324 | en_US |
| dc.identifier.epage | 342 | en_US |
| dc.identifier.isi | WOS:A1992HR25000009 | - |
| dc.publisher.place | United States | en_US |
| dc.identifier.scopusauthorid | Lam, TW=7202523165 | en_US |
| dc.identifier.issnl | 0022-0000 | - |