Last edited by Gotilar
Sunday, April 26, 2020 | History

2 edition of Computational complexity of Euclidean sets found in the catalog.

Computational complexity of Euclidean sets

Mark Braverman

Computational complexity of Euclidean sets

hyperbolic Julia sets are poly-time computable.

by Mark Braverman

  • 338 Want to read
  • 0 Currently reading

Published .
Written in English


About the Edition

We apply the concepts developed to show that hyperbolic Julia sets are polynomial time computable. This result is a significant generalization of the result in [RW03], where polynomial time computability has been shown for a restricted type of hyperbolic Julia sets.We investigate different definitions of the computability and complexity of sets in Rk , and establish new connections between these definitions. This allows us to connect the computability of real functions and real sets in a new way. We show that equivalence of some of the definitions corresponds to equivalence between famous complexity classes. The model we use is mostly consistent with [Wei00].

The Physical Object
Pagination90 leaves.
Number of Pages90
ID Numbers
Open LibraryOL22624942M
ISBN 100612952649


Share this book
You might also like
North Bay Public Library.

North Bay Public Library.

Harp of a thousand strings.

Harp of a thousand strings.

Public library materials fund and budget survey 1995-97

Public library materials fund and budget survey 1995-97

Rheumatology CD-ROM (Windows)

Rheumatology CD-ROM (Windows)

Towards community centred educationfor national harmony and development in Thailand

Towards community centred educationfor national harmony and development in Thailand

Building 16 and 7, Roeders house and White Hall Tavern, Harpers Ferry National Historical Park, Harpers Ferry, West Virginia

Building 16 and 7, Roeders house and White Hall Tavern, Harpers Ferry National Historical Park, Harpers Ferry, West Virginia

Bandit

Bandit

Public and private record repositories in Virginia

Public and private record repositories in Virginia

Bible against oppression.

Bible against oppression.

DODs industrial preparedness program needs national policy to effectively meet emergency needs

DODs industrial preparedness program needs national policy to effectively meet emergency needs

Wonders Victory (Thoroughbred 4)

Wonders Victory (Thoroughbred 4)

The constitution of the Female Mission Society, auxiliary to the New-Hampshire Baptist Domestic Mission Society

The constitution of the Female Mission Society, auxiliary to the New-Hampshire Baptist Domestic Mission Society

Further and still more important suppressed documents

Further and still more important suppressed documents

Practical loss control leadership

Practical loss control leadership

Anselm and his work

Anselm and his work

Greetings cards.

Greetings cards.

Computational complexity of Euclidean sets by Mark Braverman Download PDF EPUB FB2

Interactions of Computational Complexity Theory and Mathematics Avi Wigderson Octo Computational complexity of Euclidean sets book [This paper is a (self contained) chapter in a new book. Computational complexity theory - Wikipedia. This paper discusses computational complexity of conceptual successive convex relaxation methods proposed by Kojima and Tuncel for approximating a convex relaxation of a compact subset F = fx 2 C.

The computability of compact sets and of operators on compact sets has already been studied in the literature, cf.[13, 15, 16], also the complexity of some compact sets like Julia sets was Author: Martin Ziegler. A finite set of lines partitions the Euclidean plane into a cell complex.

Similarly, a finite set of $(d - 1)$-dimensional hyperplanes partitions d-dimensional Euclidean space. An algorithm is pres Cited by: What is known about the complexity of and/or practical algorithms for reporting all triplets of points from finite set of at least four points of which no three are collinear in the Euclidean plane.

puter Science for his book ”Neuro-Dynamic Programming” (co-authored with John Tsitsiklis), the Greek National Award for Operations Re- search, and the ACC John R.