In computational complexity theory, a certificate (also called a witness) is a string that certifies the answer to a computation, or certifies theâ€¦Â (More)

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

2016

2016

Sensitivity, block sensitivity and certificate complexity are basic complexity measures of Boolean functions. The famousâ€¦Â (More)

Is this relevant?

2016

2016

- Kun He, Qian Li, Xiaoming Sun
- ArXiv
- 2016

The sensitivity conjecture which claims that the sensitivity complexity is polynomially related to block sensitivity complexityâ€¦Â (More)

Is this relevant?

2016

2016

- Shalev Ben-David, Pooya Hatami, Avishay Tal
- ITCS
- 2016

We provide new query complexity separations against sensitivity for total Boolean functions: a power 3 separation betweenâ€¦Â (More)

Is this relevant?

2015

2015

- Scott Aaronson, Shalev Ben-David, Robin Kothari
- STOC
- 2015

We show a power 2.5 separation between bounded-error randomized and quantum query complexity for a total Boolean functionâ€¦Â (More)

Is this relevant?

2015

2015

- Robin Kothari, David Racicot-Desloges, Miklos Santha
- APPROX-RANDOM
- 2015

The subcube partition model of computation is at least as powerful as decision trees but no separation between these models wasâ€¦Â (More)

Is this relevant?

2014

2014

- Andris Ambainis, Krisjanis Prusis
- MFCS
- 2014

Sensitivity, certificate complexity and block sensitivity are widely used Boolean function complexity measures. A longstandingâ€¦Â (More)

Is this relevant?

2013

2013

- Justin Gilmer, Michael E. Saks, Srikanth Srinivasan
- 2013 IEEE Conference on Computational Complexity
- 2013

Block sensitivity (bs(f)), certificate complexity (C(f)) and fractional certificate complexity (C*(f)) are three fundamentalâ€¦Â (More)

Is this relevant?

2004

2004

- Sophie Laplante, FrÃ©dÃ©ric Magniez
- Proceedings. 19th IEEE Annual Conference onâ€¦
- 2004

We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as toâ€¦Â (More)

Is this relevant?

Review

2003

Review

2003

- Scott Aaronson
- IEEE Conference on Computational Complexity
- 2003

Given a Boolean function f , we study two natural generalizations of the certificate complexity C (f): the randomized certificateâ€¦Â (More)

Is this relevant?

1996

1996

- Sanjeev Khanna, Rajeev Motwani, Randall H. Wilson
- Algorithmica
- 1996

Recent work in dynamic graph algorithms has led to efficient algorithms for dynamic undirected graph problems such asâ€¦Â (More)

Is this relevant?