Home > ENGINEERING > COMPUTER > CS_TECHREP > 68
Equidecomposability (scissors congruence) of polyhedra in R^3 and R^4 is algorithmically decidable: Hilbert's 3rd Problem revisited
Vladik Kreinovich, The University of Texas at El PasoFollow
1-2008
Technical Report: UTEP-CS-08-01
Published in Geombinatorics, 2008, Vol. 18, No. 1, pp. 26-34.
DOWNLOADS
Since September 29, 2010
Computer Engineering Commons
Advanced Search
Comments
Technical Report: UTEP-CS-08-01
Published in Geombinatorics, 2008, Vol. 18, No. 1, pp. 26-34.