TOTO Posted September 24, 2020 Posted September 24, 2020 how to find the complexity of a formulation ( in terms of constraints and variables) (we refer generally to the notation (o(n^2) variables and o(n^3) constraints) ( i would be grateful if you mention links or examples explaining this question) - how can we justify a large gap in execution time for two formulations of the same complexity ?
studiot Posted September 24, 2020 Posted September 24, 2020 3 hours ago, TOTO said: how to find the complexity of a formulation ( in terms of constraints and variables) (we refer generally to the notation (o(n^2) variables and o(n^3) constraints) ( i would be grateful if you mention links or examples explaining this question) - how can we justify a large gap in execution time for two formulations of the same complexity ? So, if you have constraints (c) and variables (v) what is n ?
mathematic Posted September 24, 2020 Posted September 24, 2020 12 hours ago, TOTO said: how to find the complexity of a formulation ( in terms of constraints and variables) (we refer generally to the notation (o(n^2) variables and o(n^3) constraints) ( i would be grateful if you mention links or examples explaining this question) - how can we justify a large gap in execution time for two formulations of the same complexity ? Execution time strongly depends on how well written the program is.
Recommended Posts
Create an account or sign in to comment
You need to be a member in order to leave a comment
Create an account
Sign up for a new account in our community. It's easy!
Register a new accountSign in
Already have an account? Sign in here.
Sign In Now