On the Computational Complexity of Determining the Solvability or Unsolvability of the Equation X 2 - DY 2 = -1 (Q3890763)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Unfortunately, we do not yet have an article page for this item.
scientific article; zbMATH DE number 3697200
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Computational Complexity of Determining the Solvability or Unsolvability of the Equation X 2 - DY 2 = -1 |
scientific article; zbMATH DE number 3697200 |
Statements
On the Computational Complexity of Determining the Solvability or Unsolvability of the Equation X 2 - DY 2 = -1 (English)
0 references
1980
0 references
computational complexity
0 references
binary quadratic forms
0 references
form class group
0 references
Pell's equation
0 references
