Conference item

Parity helps to compute majority

Publication status:: Published

Peer review status:: Peer reviewed

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Cite

Cite this record

APA Style

Oliveira, I., Santhanam, R., & Srinivasan, S. (2019). Parity helps to compute majority. Leibniz International Proceedings in Informatics, 137.

MLA Style

Oliveira, I., et al. “Parity Helps to Compute Majority.” Leibniz International Proceedings in Informatics, vol. 137, Schloss Dagstuhl, 2019.

Chicago Style

Oliveira, I, R Santhanam, and S Srinivasan. 2019. “Parity Helps to Compute Majority.” In Leibniz International Proceedings in Informatics. Vol. 137. Leibniz International Proceedings in Informatics. Schloss Dagstuhl.
Share
Print

Access Document

Files:: Oliveira et al Parity.pdf

(Preview, Version of record, pdf, 574.6KB, Terms of use)

Publisher copy:: 10.4230/LIPIcs.CCC.2019.23

Authors

+ Oliveira, I More by this author

Institution:: University of Oxford
Division:: MPLS Division
Department:: Computer Science
Role:: Author

+ Santhanam, R More by this author

Institution:: University of Oxford
Division:: MPLS
Department:: Computer Science
Oxford college:: Magdalen College
Role:: Author

+ Srinivasan, S More by this author

Role:: Author

Publisher:: Schloss Dagstuhl
Host title:: Leibniz International Proceedings in Informatics
Journal:: 34th Computational Complexity Conference (CCC 2019) More from this journal
Volume:: 137
Article number:: 23
Series:: Leibniz International Proceedings in Informatics
Publication date:: 2019-07-16
Acceptance date:: 2019-05-01
DOI:: 10.4230/LIPIcs.CCC.2019.23
ISSN:: 1868-8969
ISBN:: 9783959771160

Keywords:: lower bounds

parity

computational complexity

majority

boolean circuits
Pubs id:: pubs:1022696
UUID:: uuid:9329505e-46b1-46a0-9bad-737298672437
Local pid:: pubs:1022696
Source identifiers:: 1022696
Deposit date:: 2019-06-25

Terms of use

Copyright holder:: Oliveira et al
Copyright date:: 2019
Notes:: © Igor C. Oliveira, Rahul Santhanam, and Srikanth Srinivasan; licensed under Creative Commons License CC-BY. This paper was presented at the 34th Computational Complexity Conference (CCC 2019), New Brunswick, New Jersey, USA, July 2019.

Licence:: CC Attribution (CC BY)

Views and Downloads

About views and downloads

If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP