2017•Springer optimization and its applicationsRequires access

Approximation and Complexity

Pãnos M. Pardalos, Antanas Žilinskas, Julius Žilinskas

Open publisher page 0 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

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.

Key concepts: Turing machine, Computer science, Time hierarchy theorem, Universal Turing machine, Computational complexity theory, Super-recursive algorithm, Turing, Theoretical computer science

Back to paper search Browse research topics Original source

Approximation and Complexity — Research Paper | ScholarLens