@article{10.1007/BF00289117,
    Address = {Berlin, Heidelberg},
    Author = {Wagner, Klaus W.},
    File = {The complexity of combinatorial problems with succinct input representation - Wagner1986\_Article\_TheComplexityOfCombinatorialPr.pdf},
    ISSN = {0001-5903},
    Journal = {Acta Inf.},
    Month = {jun},
    Number = {3},
    Pages = {325--356},
    Publisher = {Springer-Verlag},
    Title = {The Complexity of Combinatorial Problems with Succinct Input Representation},
    URL = {https://doi.org/10.1007/BF00289117},
    Volume = {23},
    Year = {1986},
    bdsk-url-1 = {https://doi.org/10.1007/BF00289117},
    date-added = {2022-02-15 10:52:33 +0100},
    date-modified = {2022-02-15 10:52:33 +0100},
    issue_date = {June 1986},
    numpages = {32},
    doi = {10.1007/BF00289117}
}

@article{10.1007/BF00289117, Address = {Berlin, Heidelberg}, Author = {Wagner, Klaus W.}, File = {The complexity of combinatorial problems with succinct input representation - Wagner1986_Article_TheComplexityOfCombinatorialPr.pdf}, ISSN = {0001-5903}, Journal = {Acta Inf.}, Month = {jun}, Number = {3}, Pages = {325--356}, Publisher = {Springer-Verlag}, Title = {The Complexity of Combinatorial Problems with Succinct Input Representation}, URL = {https://doi.org/10.1007/BF00289117}, Volume = {23}, Year = {1986}, bdsk-url-1 = {https://doi.org/10.1007/BF00289117}, date-added = {2022-02-15 10:52:33 +0100}, date-modified = {2022-02-15 10:52:33 +0100}, issue_date = {June 1986}, numpages = {32}, doi = {10.1007/BF00289117} }

Library Size: 13G (12942 entries), Last Updated: Apr 05, 2026, 08:41:35, Build Time: N/A badge