1999•Birkhäuser Boston eBooksRequires access

The Complexity of CnA

William Gasarch, Georgia A. Martin

Abstract

In this chapter we investigate the complexity of C for various n and A. We consider not only the query complexity of C as defined in Chapter 3, i.e., the least m such that there exists a set X for which C ∈ FQ(m,X), but also the number of queries to A itself that are required to compute C . (Note that, numerically speaking, the former complexity cannot exceed the latter.)

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Set (abstract data type), Computational complexity theory, Mathematics, Algorithmic complexity, Computer science, Theoretical computer science, Combinatorics, Discrete mathematics