Search Results - "68Q25: Analysis of algorithms and problem complexity"

  • Showing 1 - 2 results of 2
Refine Results
  1. 1
    Cover Image

    NP-hardness of deciding convexity of quartic polynomials and related problems by Ahmadi, Amir Ali, Olshevsky, Alex, Parrilo, Pablo A., Tsitsiklis, John N.

    ISSN: 0025-5610, 1436-4646
    Published: Berlin/Heidelberg Springer-Verlag 01.02.2013
    Published in Mathematical programming (01.02.2013)
    “…We show that unless P = NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can decide whether a multivariate polynomial of…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  2. 2
    Cover Image

    (Re)packing Equal Disks into Rectangle by Fomin, Fedor V., Golovach, Petr A., Inamdar, Tanmay, Saurabh, Saket, Zehavi, Meirav

    ISSN: 0179-5376, 1432-0444
    Published: New York Springer US 01.12.2024
    Published in Discrete & computational geometry (01.12.2024)
    “…The problem of packing of equal disks (or circles) into a rectangle is a fundamental geometric problem. (By a packing here we mean an arrangement of disks in a…”
    Get full text
    Journal Article
    Save to List
    Saved in:

Search Tools: