Amanote Research

Amanote Research

    RegisterSign In

Computing on a Free Tree via Complexity-Preserving Mappings

doi 10.1109/sfcs.1984.715936
Full Text
Open PDF
Abstract

Available in full text

Date

January 1, 1984

Authors
B. Chazelle
Publisher

IEEE


Related search

Uniform Distribution Preserving Mappings

Acta Arithmetica
Number TheoryAlgebra
1991English

Stability of Angle-Preserving Mappings on the Plane

Mathematical Inequalities and Applications
MathematicsApplied Mathematics
2005English

On the Measure-Preserving Mappings With Three-Dimensions

International Astronomical Union Colloquium
1993English

A Note on Monotone Deformation-Free Mappings

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1954English

On the Complexity of Computing Treebreadth

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

On Universal Mappings and Free Topological Groups

Bulletin of the American Mathematical Society
1948English

Computing Minimal Mappings Between Lightweight Ontologies

International Journal on Digital Libraries
LibraryInformation Sciences
2012English

Complexity in Scalable Computing

Scientific Programming
Computer Science ApplicationsSoftware
2008English

A Computational Complexity Theory in Membrane Computing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy