NDLI: Complexity Theory for Operators in Analysis

Please wait, while we are loading the content...

Complexity Theory for Operators in Analysis

Content Provider	ACM Digital Library
Author	Cook, Stephen Kawamura, Akitoshi
Copyright Year	2012
Abstract	We propose an extension of the framework for discussing the computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represented only through approximation. The key idea is to use a certain class of string functions as names representing these objects. These are more expressive than infinite sequences, which served as names in prior work that formulated complexity in more restricted settings. An advantage of using string functions is that we can define their size in a way inspired by higher-type complexity theory. This enables us to talk about computation on string functions whose time or space is bounded polynomially in the input size, giving rise to more general analogues of the classes P, NP, and PSPACE. We also define NP- and PSPACE-completeness under suitable many-one reductions. Because our framework separates machine computation and semantics, it can be applied to problems on sets of interest in analysis once we specify a suitable representation (encoding). As prototype applications, we consider the complexity of functions (operators) on real numbers, real sets, and real functions. For example, the task of numerical algorithms for solving a certain class of differential equations is naturally viewed as an operator taking real functions to real functions. As there was no complexity theory for operators, previous results only stated how complex the solution can be. We now reformulate them and show that the operator itself is polynomial-space complete.
Starting Page	1
Ending Page	24
Page Count	24
File Format	PDF
ISSN	19423454
e-ISSN	19423462
DOI	10.1145/2189778.2189780
Volume Number	4
Issue Number	2
Journal	ACM Transactions on Computation Theory (TOCT)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2012-05-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Computable analysis Computational complexity Higher-type complexity Second-order polynomials
Content Type	Text
Resource Type	Article
Subject	Computational Theory and Mathematics Theoretical Computer Science

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Complexity theory for operators in analysis

Complexity of some arithmetic problems for binary polynomials

Interpolation of Shifted-Lacunary Polynomials

On lower bounds for the complexity of polynomials and their multiples

Computable Error Bounds for Coefficients Perturbation Methods

Homogeneous Formulas and Symmetric Polynomials

Interpolation in Valiant’s Theory

Mutual Dimension

Probabilistic Type-2 Operators and “Almost”-Classes

Complexity Theory for Operators in Analysis

Similar Documents

Complexity theory for operators in analysis

Complexity of some arithmetic problems for binary polynomials

Interpolation of Shifted-Lacunary Polynomials

On lower bounds for the complexity of polynomials and their multiples

Computable Error Bounds for Coefficients Perturbation Methods

Homogeneous Formulas and Symmetric Polynomials

Interpolation in Valiant’s Theory

Mutual Dimension

Probabilistic Type-2 Operators and “Almost”-Classes

Complexity Theory for Operators in Analysis