Fractal Geometry, Turing Machines and Divide-And-Conquer Recurrences

RAIRO - Theoretical Informatics and Applications - France
doi 10.1051/ita/1994283-404051
Full Text
Abstract

Available in full text

Date
Authors
Publisher

EDP Sciences

Related search

Divide and Conquer

1993English

Divide and Conquer

2018English

Divide-And-Conquer Algorithms for Multiprocessors

English

Divide and Conquer Roadmap for Algebraic Sets

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2014English

Physiotherapy After Stroke: Define, Divide and Conquer

Journal of Neurology, Neurosurgery and Psychiatry
PsychiatryMental HealthNeurologySurgery
2005English

Ultrametric Automata and Turing Machines

English

Practical Divide-And-Conquer Algorithms for Polynomial Arithmetic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

A Divide-And-Conquer Method for the Takagi Factorization

SIAM Journal on Matrix Analysis and Applications
Analysis
2008English

Adaptive History Compression for Learning to Divide and Conquer

English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy