Combinatorial complexity of translating a box in polyhedral 3-space
نویسندگان
چکیده
منابع مشابه
a frame semantic approach to the study of translating cultural scripts in salingers franny and zooey
the frame semantic theory is a nascent approach in the area of translation studies which goes beyond the linguistic barriers and helps us to incorporate cognitive and cultural factors to the study of translation. based on rojos analytical model (2002b), which centered in the frames or knowledge structures activated in the text, the present research explores the various translation problems that...
15 صفحه اولTime and Space Complexity Reduction of a Cryptanalysis Algorithm
Binary Decision Diagram (in short BDD) is an efficient data structure which has been used widely in computer science and engineering. BDD-based attack in key stream cryptanalysis is one of the best forms of attack in its category. In this paper, we propose a new key stream attack which is based on ZDD(Zero-suppressed BDD). We show how a ZDD-based key stream attack is more efficient in time and ...
متن کاملPolyhedral techniques in combinatorial optimization
Generally, combinatorial optimization problems are easy to formulate, but hard to solve. The most successfull approaches, cutting plane algorithms and column generation, rely on the (mixed) integer linear programming formulation of a problem. The theory of polyhedra, i.e., polyhedral combinatorics, is the foundation of these techniques. This manuscript intends to give an overview of polyhedral ...
متن کاملCombinatorial Aperiodicity of Polyhedral Prototiles∗
The paper studies combinatorial prototiles of locally finite face-to-face tilings of euclidean d-space Ed by convex d-polytopes. A finite set P of prototiles is called combinatorially aperiodic if P admits a locally finite face-to-face tiling by combinatorially equivalent copies of the prototiles in P, but no such tiling with a combinatorial automorphism of infinite order. The paper describes s...
متن کاملTime and Space Complexity Reduction of a Cryptanalysis Algorithm
Binary Decision Diagram (in short BDD) is an efficient data structure which has been used widely in computer science and engineering. BDD-based attack in key stream cryptanalysis is one of the best forms of attack in its category. In this paper, we propose a new key stream attack which is based on ZDD(Zero-suppressed BDD). We show how a ZDD-based key stream attack is more efficient in time and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1998
ISSN: 0925-7721
DOI: 10.1016/s0925-7721(97)00030-8