Sasha the Noob

Member for 8 years, 9 months
Last seen more than 2 years ago

Summary

Reputation

613

613
568
523

2020
2021
2022
2023

Top tag

complexity-theory

Next privilege

1,000 Rep.

See votes

Badges

1

6

9

Newest

Yearling

Next badge

0/1

Critic

Questions

Score Activity Newest Views

40

Why is linear programming in P but integer programming NP-hard?

Mar 12, 2015

9

If a convex optimization problem can be NP-Hard, in what sense are convex problems easier than non-convex problems?

Sep 19, 2019

1

References for the computational complexity of training neural networks

Dec 18, 2017

1

Can an optimization algorithm be "universal"?

Sep 1, 2019

Answers

Score Activity Newest

This user has not answered any questions

Tags

View all 12 tags

complexity-theory

0

Score

3

posts

optimization

0

Score

2

posts

reference-request

0

Score

1

post

np-hard

0

Score

1

post

convex-hull

0

Score

1

post

Reputation

+90

If a convex optimization problem can be NP-Hard, in what sense are convex problems easier than non-convex problems?

+120

Why is linear programming in P but integer programming NP-hard?

+10

Can an optimization algorithm be "universal"?

+10

References for the computational complexity of training neural networks

Badges

View all badges

1

gold badge

Famous Question

Oct 1, 2018

6

silver badges

Good Question

Sep 28, 2016
Constituent

Jan 28, 2019
Notable Question

Jul 29, 2015

9

bronze badges

Nice Question

Mar 13, 2015
Custodian

Mar 13, 2015
Caucus

Jan 28, 2019

Accounts

Computer Science

613
1
6
9

Active bounties (0)

Active Offered Earned

This user has no active bounties

Votes cast

6

upvotes

2

question votes

4

answer votes