# Cheat sheet

## Papers overview

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

2016

2016

- IEEE 57th Annual Symposium on Foundations of…
- 2016

While exponential separations are known between quantum and randomized communication complexity for partial functions (Raz, STOC… (More)

Is this relevant?

2015

2015

- 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

- IEEE Data Eng. Bull.
- 2015

There has been much research on various aspects of Approximate Query Processing (AQP), such as different sampling strategies… (More)

Is this relevant?

2015

2015

- ArXiv
- 2015

Multidimensional Continued Fraction Algorithms are generalizations of the Euclid algorithm and find iteratively the gcd of two or… (More)

Is this relevant?

Review

2013

Review

2013

- 2013

This is a “cheat sheet”, which means that it consists of information packaged in a concise and efficient way so that it can… (More)

Is this relevant?

2012

2012

- 2012

The differences between open-book, cheat sheet, and closed-book exams were examined in two different types of psychology courses… (More)

Is this relevant?

2011

2011

- 2011

This document contains notes on how to handle the multivariate Gaussian1 in a Bayesian setting. It focuses on the conjugate prior… (More)

Is this relevant?

Review

2010

Review

2010

- RP
- 2010

Lossy counter machines (LCM’s) are a variant of Minsky counter machines based on weak (or unreliable) counters in the sense that… (More)

Is this relevant?

1997

1997

- SIGACT News
- 1997

A collection of important concepts and formulas on theoretical computer science was recently published in this journal [1]. I… (More)

Is this relevant?

1996

1996

- SIGACT News
- 1996

Deenitions Series f(n) = O(g(n)) ii 9 positive cc n 0 such t h a t 0 f(n) cg(n) 8n n 0 .

Is this relevant?