Academic literature on the topic 'Approximate counting'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Approximate counting.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Approximate counting"

1

BUSS, SAMUEL R., LESZEK ALEKSANDER KOŁODZIEJCZYK, and NEIL THAPEN. "FRAGMENTS OF APPROXIMATE COUNTING." Journal of Symbolic Logic 79, no. 2 (2014): 496–525. http://dx.doi.org/10.1017/jsl.2013.37.

Full text
Abstract:
AbstractWe study the long-standing open problem of giving $\forall {\rm{\Sigma }}_1^b$ separations for fragments of bounded arithmetic in the relativized setting. Rather than considering the usual fragments defined by the amount of induction they allow, we study Jeřábek’s theories for approximate counting and their subtheories. We show that the $\forall {\rm{\Sigma }}_1^b$ Herbrandized ordering principle is unprovable in a fragment of bounded arithmetic that includes the injective weak pigeonhole principle for polynomial time functions, and also in a fragment that includes the surjective weak
APA, Harvard, Vancouver, ISO, and other styles
2

Aronov, Boris, and Micha Sharir. "Approximate Halfspace Range Counting." SIAM Journal on Computing 39, no. 7 (2010): 2704–25. http://dx.doi.org/10.1137/080736600.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Louchard, Guy, and Helmut Prodinger. "Generalized approximate counting revisited." Theoretical Computer Science 391, no. 1-2 (2008): 109–25. http://dx.doi.org/10.1016/j.tcs.2007.10.035.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Jeřábek, Emil. "Approximate counting in bounded arithmetic." Journal of Symbolic Logic 72, no. 3 (2007): 959–93. http://dx.doi.org/10.2178/jsl/1191333850.

Full text
Abstract:
AbstractWe develop approximate counting of sets definable by Boolean circuits in bounded arithmetic using the dual weak pigeonhole principle (dWPHP(PV)), as a generalization of results from [15]. We discuss applications to formalization of randomized complexity classes (such as BPP, APP, MA, AM) in PV1 + dWPHP(PV).
APA, Harvard, Vancouver, ISO, and other styles
5

Cichoń, Jacek, and Karol Gotfryd. "Average Counting via Approximate Histograms." ACM Transactions on Sensor Networks 14, no. 2 (2018): 1–32. http://dx.doi.org/10.1145/3177922.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kirschenhofer, Peter, and Helmut Prodinger. "Approximate counting : an alternative approach." RAIRO - Theoretical Informatics and Applications 25, no. 1 (1991): 43–48. http://dx.doi.org/10.1051/ita/1991250100431.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

BORDEWICH, M., M. FREEDMAN, L. LOVÁSZ, and D. WELSH. "Approximate Counting and Quantum Computation." Combinatorics, Probability and Computing 14, no. 5-6 (2005): 737. http://dx.doi.org/10.1017/s0963548305007005.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Flajolet, Philippe. "Approximate counting: A detailed analysis." BIT 25, no. 1 (1985): 113–34. http://dx.doi.org/10.1007/bf01934993.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Erdős, Péter L., Sándor Z. Kiss, István Miklós, and Lajos Soukup. "Approximate Counting of Graphical Realizations." PLOS ONE 10, no. 7 (2015): e0131300. http://dx.doi.org/10.1371/journal.pone.0131300.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Aldous, David. "Approximate Counting via Markov Chains." Statistical Science 8, no. 1 (1993): 16–19. http://dx.doi.org/10.1214/ss/1177011078.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!