@article{Beame_2007,
    doi = {10.1137/060654645},
    url = {https://doi.org/10.1137%2F060654645},
    year = {2007},
    month = {jan},
    publisher = {Society for Industrial {\&} Applied Mathematics ({SIAM})},
    volume = {37},
    number = {3},
    pages = {845--869},
    author = {Paul Beame and Toniann Pitassi and Nathan Segerlind},
    title = {Lower Bounds for Lov{\'{a}}sz{\textendash}Schrijver Systems and Beyond Follow from Multiparty Communication Complexity},
    journal = {{SIAM} Journal on Computing}
}

@article{Beame_2007, doi = {10.1137/060654645}, url = {https://doi.org/10.1137%2F060654645}, year = {2007}, month = {jan}, publisher = {Society for Industrial {\&} Applied Mathematics ({SIAM})}, volume = {37}, number = {3}, pages = {845--869}, author = {Paul Beame and Toniann Pitassi and Nathan Segerlind}, title = {Lower Bounds for Lov{\'{a}}sz{\textendash}Schrijver Systems and Beyond Follow from Multiparty Communication Complexity}, journal = {{SIAM} Journal on Computing} }