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.

Review

2018

Review

2018

This review summarizes recent progress in the development of cobalt-based catalytic centers as the most potentially useful… Expand

Is this relevant?

Highly Cited

2009

Highly Cited

2009

SPARQL is the standard language for querying RDF data. In this article, we address systematically the formal study of the… Expand

Is this relevant?

Highly Cited

2009

Highly Cited

2009

Kernelization is a strong and widely-applied technique in parameterized complexity. A kernelization algorithm, or simply a kernel… Expand

Is this relevant?

Highly Cited

2008

Highly Cited

2008

The OR-SAT problem asks, given Boolean formulae Φ1,...,Φm each of size at most n, whether at least one of the Φi's is satisfiable… Expand

Is this relevant?

Highly Cited

2007

Highly Cited

2007

We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

Recently, it has been shown that the small description logic (DL) EL, which allows for conjunction and existential restrictions… Expand

Is this relevant?

Highly Cited

1998

Highly Cited

1998

This paper starts with the project of finding a large subclass of NP which exhibits a dichotomy. The approach is to find this… Expand

Is this relevant?

Highly Cited

1998

Highly Cited

1998

We show that the shortest vector problem in lattices with La norm is NP-hard for randomized reductions. Moreover we also show… Expand

Is this relevant?

Highly Cited

1987

Highly Cited

1987

Abstract Babai (1985) and Goldwasser,Micali and Rackoff (1985) introduced two probabilistic extensions of the complexity class NP… Expand

Is this relevant?

Highly Cited

1986

Highly Cited

1986

Linear expanders have numerous applications to theoretical computer science. Here we show that a regular bipartite graph is an… Expand

Is this relevant?