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.

2016

2016

We define a concept class <i>F</i> to be time-space hard (or memory-samples hard) if any learning algorithm for <i>F</i> requires… Expand

Is this relevant?

2016

2016

One of the major challenges of the research in circuit complexity is proving super-polynomial lower bounds for de-Morgan formulas… Expand

Is this relevant?

Highly Cited

2014

Highly Cited

2014

We show how to efficiently simulate the sending of a single message M to a receiver who has partial information about the message… Expand

Is this relevant?

2013

2013

We give an explicit function h: {0, 1}n → {0, 1} such that every deMorgan formula of size n3-o(1)/r2 agrees with h on at most a… Expand

Is this relevant?

2010

2010

This paper deals with the speed control of a variable speed doubly-fed induction generator (DFIG)-based marine current turbine… Expand

Is this relevant?

Highly Cited

2008

Highly Cited

2008

In a two player game, a referee asks two cooperating players (who are not allowed to communicate) questions sampled from some… Expand

Is this relevant?

2007

2007

Motivated by the study of parallel repetition and also by the unique games conjecture, we investigate the value of the "odd cycle… Expand

Is this relevant?

Highly Cited

2006

Highly Cited

2006

We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a… Expand

Is this relevant?

Highly Cited

2002

Highly Cited

2002

Given a graph with a cost and a delay on each edge, Restricted Shortest Path (RSP) aims to find a min-cost s-t path subject to an… Expand

Is this relevant?

Highly Cited

1997

Highly Cited

1997

NP = PCP(logn, 1) and related results crucially depend upon the close connection between the probability with which a function… Expand

Is this relevant?