Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 205,471,938 papers from all fields of science

Search

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

Highly Cited

2013

Highly Cited

2013

In this work, we study indistinguishability obfuscation and functional encryption for general circuits: Indistinguishability…

Highly Cited

2012

Highly Cited

2012

Informally, an <i>obfuscator</i> <i>O</i> is an (efficient, probabilistic) “compiler” that takes as input a program (or circuit…

Highly Cited

2009

Highly Cited

2009

A method is proposed, called channel polarization, to construct code sequences that achieve the symmetric capacity I(W) of any…

Highly Cited

2006

Highly Cited

2004

Highly Cited

2004

We consider a random graph process in which vertices are
added to the graph one at a time and joined to a fixed number
m of…

Highly Cited

1998

Highly Cited

1998

Consider a set of <italic>S</italic> of <italic>n</italic> data points in real <italic>d</italic>-dimensional space, R<supscrpt…

Highly Cited

1998

Highly Cited

1998

We present a polynomial time approximation scheme for Euclidean TSP in fixed dimensions. For every fixed <italic>c</italic> > 1…

Highly Cited

1997

Highly Cited

1997

Conventional video cameras have limited fields of view that make them restrictive in a variety of vision applications. There are…

Highly Cited

1974

Highly Cited

1974

Highly Cited

1970

Highly Cited

1970

is called the effective domain of F, and F is said to be locally bounded at a point x e D(T) if there exists a neighborhood U of…