• Login
    Search 
    •   SMARTech Home
    • College of Computing (CoC)
    • College of Computing Theses and Dissertations
    • Search
    •   SMARTech Home
    • College of Computing (CoC)
    • College of Computing Theses and Dissertations
    • Search
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Search

    Show Advanced FiltersHide Advanced Filters

    Filters

    Use filters to refine the search results.

    Now showing items 1-1 of 1

    • Sort Options:
    • Relevance
    • Title Asc
    • Title Desc
    • Issue Date Asc
    • Issue Date Desc
    • Results Per Page:
    • 5
    • 10
    • 20
    • 40
    • 60
    • 80
    • 100
    Thumbnail

    Hardness and tractability for structured numerical problems 

    Zhang, Peng (Georgia Institute of Technology, 2018-08-24)
    We study structured linear systems and structured linear programs (LPs) from both algorithm and complexity perspectives. These structured problems commonly arise in combinatorial optimization, machine learning, and operation ...

    Browse

    All of SMARTechCommunities & CollectionsDatesAuthorsTitlesSubjectsTypesThis CollectionDatesAuthorsTitlesSubjectsTypes

    My SMARTech

    Login

    Discover

    AuthorZhang, Peng (1)Subject
    Algorithms (1)
    Generalized Laplacian matrices (1)
    Hardness (1)
    Linear programs (1)
    Linear systems (1)
    Packing and covering LPs (1)
    ... View MoreDate Issued
    2018 (1)
    Has File(s)
    Yes (1)
    facebook instagram twitter youtube
    • My Account
    • Contact us
    • Directory
    • Campus Map
    • Support/Give
    • Library Accessibility
      • About SMARTech
      • SMARTech Terms of Use
    Georgia Tech Library266 4th Street NW, Atlanta, GA 30332
    404.894.4500
    • Emergency Information
    • Legal and Privacy Information
    • Human Trafficking Notice
    • Accessibility
    • Accountability
    • Accreditation
    • Employment
    © 2020 Georgia Institute of Technology