Complexity of Operators on Compact Sets | Zendy

Xishun Zhao | Zendy; Norbert Müller | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Complexity of Operators on Compact Sets

Author(s) -

Xishun Zhao,

Norbert Müller

Publication year - 2008

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2008.03.011

Subject(s) - oracle , connection (principal bundle) , time hierarchy theorem , convex hull , mathematics , projection (relational algebra) , dtime , turing , computational complexity theory , computer science , theoretical computer science , hull , discrete mathematics , turing machine , regular polygon , algorithm , combinatorics , universal turing machine , geometry , marine engineering , engineering , computation , programming language , software engineering

Based on oracle Turing machines, we investigate the computational complexity of operators on compact sets. For the projection and convex hull we are able to show exponential upper and lower bounds as well as a connection to the P=NP problem for special settings

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research