Do exactly solvable stat mech systems admit efficient algorithms for finite sizes?
Answers
Answered by
0
no approximately or exactly solvable that make systems admit efficient algorithms for finite sizes.
its varies so that they are not constant
its varies so that they are not constant
Answered by
0
no exactly solvable system not admitted recent algorithms
Similar questions