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

Kreinovich, Vladik

Local TagsRelease HistoryDetailsSummary

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

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.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/21.11116/0000-0004-2892-A Version Permalink: https://hdl.handle.net/21.11116/0000-0004-2893-9

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Kreinovich, Vladik¹, Author

Affiliations:
1Max Planck Institute for Mathematics, Max Planck Society, ou_3029201

Content

show

Details

show

hide

Language(s): eng - English

Dates: Date issued: 2008

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 378243

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Geombinatorics

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 18 (1) Sequence Number: - Start / End Page: 26 - 34 Identifier: -