isExactlySolvable
P67394
predicate
Indicates that a problem, model, or equation can be solved completely and exactly (without approximation) using known analytical or algorithmic methods.
Observed surface forms (2)
| Surface form | Occurrences |
|---|---|
| isExactlySolvableBy | 4 |
| exactlySolvableIn | 2 |
Sample triples (7)
| Subject | Object |
|---|---|
| Schwinger model | true ⓘ |
| Potts model | two dimensions for certain q via predicate surface "exactlySolvableIn" ⓘ |
| XXZ spin chain | Bethe ansatz via predicate surface "isExactlySolvableBy" ⓘ |
| XXZ spin chain | algebraic Bethe ansatz via predicate surface "isExactlySolvableBy" ⓘ |
| XXZ spin chain | coordinate Bethe ansatz via predicate surface "isExactlySolvableBy" ⓘ |
| XXZ spin chain | quantum inverse scattering method via predicate surface "isExactlySolvableBy" ⓘ |
| Hubbard model | one dimension by Bethe ansatz via predicate surface "exactlySolvableIn" ⓘ |