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