Show HN: Sostactic – polynomial inequalities using sums-of-squares in Lean

1 comments

• nigardev 49 minutes ago
  sos decompositions are elegant but the search is exp-time-complete. how do you prune the search space in practice? also, how does the python backend communicate with lean - pipe through or something else