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
Sign in
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
Sign in
Register
Dashboard
Search
28
views
12
references
Top references
cited by
12
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
3,087
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity
other
Author(s):
Jürgen Forster
,
Matthias Krause
,
Satyanarayana V. Lokam
,
Rustam Mubarakzjanov
,
Niels Schmitt
,
Hans Ulrich Simon
Publication date
(Online):
November 26 2001
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
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
Computational Communication Research
Most cited references
12
Record
: found
Abstract
: not found
Book
: not found
Branching Programs and Binary Decision Diagrams
Ingo Wegener
(2000)
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)
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)
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
Sign in to comment
Book chapters
pp. 171
Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity
Similar content
3,087
Noncollinear Spin Arrangement in Ultrafine Ferrimagnetic Crystallites
Authors:
J. Coey
Electro-Osmotic Dehydration of Hangzhou Sludge with Selected Electrode Arrangements
Authors:
Yanli Tao
,
Jian Zhou
,
Xiaonan Gong
…
Historical development of institutional arrangements for forest monitoring and REDD + MRV in Peru: Discursive-institutionalist perspectives
Authors:
M. Herold
,
R.M. Ochieng
,
I.J. Visseren-Hamakers
…
See all similar
Cited by
12
Complexity measures of sign matrices
Authors:
Adi Shraibman
,
Gideon Schechtman
,
Shahar Mendelson
…
A linear lower bound on the unbounded error probabilistic communication complexity
Authors:
Jürgen Forster
The unbounded-error communication complexity of symmetric functions
Authors:
Alexander A. Sherstov
See all cited by