1989•Lecture notes in computer scienceRequires access

Separating completely complexity classes related to polynomial size Ω-Decision trees

Carsten Damm, Christoph Meinel

Open publisher page 8 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

OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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: Nondeterministic algorithm, NP, Parity (physics), Computer science, Time complexity, Exponential function, Polynomial, Computational complexity theory

Back to paper search Browse research topics Original source

Separating completely complexity classes related to polynomial size Ω-Decision trees — Research Paper | ScholarLens