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.

Highly Cited

2016

Highly Cited

2016

We show a power 2.5 separation between bounded-error randomized and quantum query complexity for a total Boolean function… Expand

Is this relevant?

2014

2014

Sensitivity, certificate complexity and block sensitivity are widely used Boolean function complexity measures. A longstanding… Expand

Is this relevant?

2011

2011

Abstract A certifying algorithm for a problem is an algorithm that provides a certificate with each answer that it produces. The… Expand

Is this relevant?

2010

2010

In this paper we study relationships between CNF representations of a given Boolean function f and essential sets of implicates… Expand

Is this relevant?

2008

2008

Given a Boolean function f, we study two natural generalizations of the certificate complexity C(f): the randomized certificate… Expand

Is this relevant?

2008

2008

A certifying algorithm for a problem is an algorithm that provides a certificate with each answer that it produces. The… Expand

Is this relevant?

2006

2006

We study several complexity parameters for first order formulas and their suitability for first order learning models. We show… Expand

Is this relevant?

2002

2002

Given a Boolean function f, we study two natural generalizations of the certificate complexity C(f): the randomized certificate… Expand

Is this relevant?

Highly Cited

2001

Highly Cited

2001

Model Checking is an algorithmic technique to determine whether a temporal property holds of a program. For linear time… Expand

Is this relevant?

1996

1996

Recent work in dynamic graph algorithms has led to efficient algorithms for dynamic undirected graph problems such as… Expand

Is this relevant?