1 resultado para implementation and complexity theory
em DI-fusion - The institutional repository of Université Libre de Bruxelles
Filtro por publicador
- JISC Information Environment Repository (2)
- Abertay Research Collections - Abertay University’s repository (2)
- Aberystwyth University Repository - Reino Unido (2)
- Academic Archive On-line (Jönköping University; Sweden) (1)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (2)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (8)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (2)
- Aquatic Commons (5)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (1)
- Archive of European Integration (21)
- Aston University Research Archive (38)
- Biblioteca de Teses e Dissertações da USP (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (4)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (3)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (2)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (27)
- Brock University, Canada (5)
- Bucknell University Digital Commons - Pensilvania - USA (1)
- Bulgarian Digital Mathematics Library at IMI-BAS (2)
- CaltechTHESIS (5)
- Cambridge University Engineering Department Publications Database (15)
- CentAUR: Central Archive University of Reading - UK (41)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (6)
- Cochin University of Science & Technology (CUSAT), India (4)
- Coffee Science - Universidade Federal de Lavras (1)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (6)
- CORA - Cork Open Research Archive - University College Cork - Ireland (8)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (2)
- Dalarna University College Electronic Archive (4)
- Deakin Research Online - Australia (87)
- Department of Computer Science E-Repository - King's College London, Strand, London (3)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (1)
- Digital Commons - Michigan Tech (2)
- Digital Commons @ DU | University of Denver Research (1)
- Digital Commons at Florida International University (15)
- Digital Peer Publishing (2)
- DigitalCommons - The University of Maine Research (1)
- DigitalCommons@The Texas Medical Center (10)
- DigitalCommons@University of Nebraska - Lincoln (1)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (1)
- DRUM (Digital Repository at the University of Maryland) (1)
- Duke University (5)
- Ecology and Society (1)
- FUNDAJ - Fundação Joaquim Nabuco (1)
- Glasgow Theses Service (3)
- Greenwich Academic Literature Archive - UK (4)
- Helda - Digital Repository of University of Helsinki (9)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (2)
- Indian Institute of Science - Bangalore - Índia (19)
- Instituto Politécnico do Porto, Portugal (2)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (1)
- Martin Luther Universitat Halle Wittenberg, Germany (1)
- Massachusetts Institute of Technology (4)
- Memoria Académica - FaHCE, UNLP - Argentina (6)
- Memorial University Research Repository (2)
- Ministerio de Cultura, Spain (2)
- National Center for Biotechnology Information - NCBI (1)
- Nottingham eTheses (6)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (3)
- Portal de Revistas Científicas Complutenses - Espanha (1)
- QSpace: Queen's University - Canada (2)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (59)
- Queensland University of Technology - ePrints Archive (263)
- Repositório Científico da Universidade de Évora - Portugal (1)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (7)
- Repositório Institucional da Universidade de Aveiro - Portugal (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (6)
- Repositorio Institucional Universidad de Medellín (2)
- Research Open Access Repository of the University of East London. (3)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (2)
- Savoirs UdeS : plateforme de diffusion de la production intellectuelle de l’Université de Sherbrooke - Canada (1)
- School of Medicine, Washington University, United States (1)
- Scielo España (1)
- Universidad del Rosario, Colombia (7)
- Universidad Politécnica de Madrid (22)
- Universidade Complutense de Madrid (1)
- Universidade Federal do Rio Grande do Norte (UFRN) (2)
- Universidade Metodista de São Paulo (2)
- Universidade Técnica de Lisboa (1)
- Universita di Parma (1)
- Universitat de Girona, Spain (8)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (4)
- Université de Montréal, Canada (7)
- University of Connecticut - USA (4)
- University of Michigan (26)
- University of Queensland eSpace - Australia (20)
- University of Southampton, United Kingdom (2)
- University of Washington (6)
- WestminsterResearch - UK (11)
- Worcester Research and Publications - Worcester Research and Publications - UK (3)
Resumo:
An extended formulation of a polyhedron P is a linear description of a polyhedron Q together with a linear map π such that π(Q)=P. These objects are of fundamental importance in polyhedral combinatorics and optimization theory, and the subject of a number of studies. Yannakakis’ factorization theorem (Yannakakis in J Comput Syst Sci 43(3):441–466, 1991) provides a surprising connection between extended formulations and communication complexity, showing that the smallest size of an extended formulation of $$P$$P equals the nonnegative rank of its slack matrix S. Moreover, Yannakakis also shows that the nonnegative rank of S is at most 2c, where c is the complexity of any deterministic protocol computing S. In this paper, we show that the latter result can be strengthened when we allow protocols to be randomized. In particular, we prove that the base-2 logarithm of the nonnegative rank of any nonnegative matrix equals the minimum complexity of a randomized communication protocol computing the matrix in expectation. Using Yannakakis’ factorization theorem, this implies that the base-2 logarithm of the smallest size of an extended formulation of a polytope P equals the minimum complexity of a randomized communication protocol computing the slack matrix of P in expectation. We show that allowing randomization in the protocol can be crucial for obtaining small extended formulations. Specifically, we prove that for the spanning tree and perfect matching polytopes, small variance in the protocol forces large size in the extended formulation.