ScholarLens Back to search
1993•Theory of Computing SystemsOpen access

On the power of deterministic reductions to C=P

Frederic Green

Open full text 26 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 26 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, Complexity class, Time complexity, Oracle, Turing machine, Polynomial hierarchy, Combinatorics, NP

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
On the power of deterministic reductions to C=P — Research Paper | ScholarLens