Equidecomposability (scissors congruence) of polyhedra in R^3 and R^4 is 
algorithmically decidable: Hilbert's 3rd problem revisted

Kreinovich, Vladik

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Equidecomposability (scissors congruence) of polyhedra in R^3 and R^4 is algorithmically decidable: Hilbert's 3rd problem revisted

MPS-Authors

/persons/resource/persons235621

Kreinovich, Vladik
Max Planck Institute for Mathematics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Kreinovich, V. (2008). Equidecomposability (scissors congruence) of polyhedra in R^3 and R^4 is algorithmically decidable: Hilbert's 3rd problem revisted. Geombinatorics, 18(1), 26-34.

Cite as: https://hdl.handle.net/21.11116/0000-0004-2892-A

Abstract

There is no abstract available