Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2019

2019

We show that $$\mathsf {RT} (2,4)$$RT(2,4) cannot be proved with one typical application of $$\mathsf {RT} (2,2)$$RT(2,2) in an… Expand

Is this relevant?

2016

2016

The aim of the paper is to examine the computational complexity and algorithmics of enumeration, the task to output all solutions… Expand

Is this relevant?

2015

2015

We define a notion of reducibility for subsets of a second countable T0 topological space based on relatively continuous… Expand

Is this relevant?

Highly Cited

2012

Highly Cited

2012

Abstract We study closed choice principles for different spaces. Given information about what does not constitute a solution… Expand

Is this relevant?

Highly Cited

2009

Highly Cited

2009

In this paper we study a reducibility that has been intro- duced by Klaus Weihrauch or, more precisely, a natural extension of… Expand

Is this relevant?

2007

2007

We show that a family of tree languages W$_{(l,k)}$, previously used by J. Bradfield, and by the first author to show the… Expand

Is this relevant?

2005

2005

Do self-reducible sets inherently lack immunity from deterministic polynomial time? Though this is unlikely to be true in general… Expand

Is this relevant?

2004

2004

We study reducibilities that act as measures of relative randomness on reals, concentrating particularly on their behavior on the… Expand

Is this relevant?

1989

1989

In this paper, a new class of zero knowledge interactive proofs, a divertible zero knowledge interactive proof, is presented… Expand

Is this relevant?

Highly Cited

1987

Highly Cited

1987

The notion of a zero knowledge interactive proof that one party "knows" some secret information is explored. It is shown that any… Expand

Is this relevant?