Skip to main navigation
Skip to search
Skip to main content

Princeton University Home

Help & FAQ

Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media

Search by expertise, name or affiliation

Parabolic Julia sets are polynomial time computable

Mark Braverman

Research output: Contribution to journal › Article › peer-review

17 Scopus citations

Overview
Fingerprint

Fingerprint

Dive into the research topics of 'Parabolic Julia sets are polynomial time computable'. Together they form a unique fingerprint.

Sort by
Weight
Alphabetically

Keyphrases

Mathematics

Powered by Pure, Scopus & Elsevier Fingerprint Engine™

All content on this site: Copyright © 2025 Princeton University, its licensors, and contributors. All rights are reserved, including those for text and data mining, AI training, and similar technologies. For all open access content, the relevant licensing terms apply

We use cookies to help provide and enhance our service and tailor content. By continuing you agree to the use of cookies

About web accessibility

Report vulnerability