Equidecomposability (scissors congruence) of polyhedra in \(\mathbb R^3\) and \(\mathbb R^4\) is algorithmically decidable: Hilbert's 3rd problem revisited (Q3602153)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Equidecomposability (scissors congruence) of polyhedra in R^3 and R^4 is algorithmically decidable: Hilbert's 3rd problem revisited |
scientific article; zbMATH DE number 5507170
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Equidecomposability (scissors congruence) of polyhedra in \(\mathbb R^3\) and \(\mathbb R^4\) is algorithmically decidable: Hilbert's 3rd problem revisited |
scientific article; zbMATH DE number 5507170 |
Statements
12 February 2009
0 references
Hilbert's third problem
0 references
scissors congruence
0 references
equidecomposability
0 references
algorithmical decidability
0 references
Tarski algorithm
0 references
elementary geometry
0 references
0.8642109632492065
0 references
0.8300394415855408
0 references
0.8002802729606628
0 references
0.8002802729606628
0 references
