1 research outputs found

    Computational Complexity of Discrete Problems (Dagstuhl Seminar 17121)

    No full text
    This report documents the program and the outcomes of Dagstuhl Seminar 17121 "Computational Complexity of Discrete Problems". The first section gives an overview of the topics covered and the organization of the meeting. Section 2 lists the talks given in alphabetical order. The last section contains the abstracts of the talks
    corecore