Publications
Preprints
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
Information for reviewers
Review process
How to peer review
Peer review policy
Register Dashboard
Search

Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen

Register Dashboard
Search
27
views
12
references
 Top references
cited by
12
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      3,180
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Book Chapter: not found

      Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity

      other

      Read this book at

      Publisher
      Buy book
      Bookmark
          There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references12

          • Record: found
          • Abstract: not found
          • Book: not found

          Branching Programs and Binary Decision Diagrams

          Ingo Wegener (2000)
          Book 0 comments Cited 24 times – based on 0 reviews
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Threshold circuits of bounded depth

            Wolfgang Maass, Andras Hajnal, Pavel Pudlak … (1993)
            Article 0 comments Cited 17 times – based on 0 reviews     Review now
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Probabilistic communication complexity

              Ramamohan Paturi, Janos Simon (1986)
              Article 0 comments Cited 16 times – based on 0 reviews     Review now
                Bookmark
                All references

                Author and book information

                Book Chapter
                Publication date (Print): 2001
                Publication date (Online): November 26 2001
                Pages: 171-182
                DOI: 10.1007/3-540-45294-X_15
                SO-VID: e9a10ea6-7b4b-456e-bc85-3cdf2e8e3ff0
                History

                Data availability:

                Comments

                Comment on this book

                Book chapters

                Similar content3,180

                See all similar

                Cited by12

                See all cited by