Home

Open Problem Garden

  • Help
  • About
  • Contact
  login/create account

recreational mathematics


Goemans, Michel (?)


Theoretical Comp. Sci. » Complexity

Complexity of square-root sum ★★

Author(s): Goemans

Question   What is the complexity of the following problem?

Given $ a_1,\dots,a_n; k $, determine whether or not $  \sum_i \sqrt{a_i} \leq k.  $

Keywords: semi-definite programming

Posted by abie
updated July 1st, 2011
5 comments

semi-definite programming


graceful labeling


combinatorics


locally testable


coding


robustness


codes


« first‹ previous…156157158159160161162163164…next ›last »

Navigate

  • Subject
    • Algebra (298)
    • Analysis (5)
    • Combinatorics (35)
    • Geometry (29)
    • Graph Theory (228)
    • Group Theory (5)
    • Logic (10)
    • Number Theory (49)
    • PDEs (0)
    • Probability (1)
    • Theoretical Comp. Sci. (13)
    • Topology (40)
    • Unsorted (1)
  • Author index
  • Keyword index
  • more

Recent Activity

  • Is Dragon Ball Legends Safe? Account Security Guide — Avoid Bans, Scams & Hacks (2026)
  • Dragon Ball Legends PvP Team Building Guide — Tags, Synergy & Win Conditions (2026)
  • Dragon Ball Legends Free Chrono Crystals — Legit Methods That Actually Work (2026)
  • Dragon Ball Legends Free Chrono Crystals — Legit Methods That Actually Work (2026)
  • Nowhere-zero flows
more
Powered by  Drupal                       Hosted by  CSI of Charles University                       Content distributed under                       Disclaimer