Relevant bibliographies by topics / Randomness complexity

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Randomness complexity'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

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 'Randomness complexity.'

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 "Randomness complexity"

1

Downey, Rod. "Computability, Complexity and Randomness." Theory of Computing Systems 52, no. 1 (2012): 1. http://dx.doi.org/10.1007/s00224-012-9430-3.

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

Karp, Richard M. "Combinatorics, complexity, and randomness." Communications of the ACM 29, no. 2 (1986): 98–109. http://dx.doi.org/10.1145/5657.5658.

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

Hitchcock, John M., A. Pavan, and N. V. Vinodchandran. "Kolmogorov Complexity in Randomness Extraction." ACM Transactions on Computation Theory 3, no. 1 (2011): 1–12. http://dx.doi.org/10.1145/2003685.2003686.

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

Chung, Fan R. K., and Prasad Tetali. "Communication Complexity and Quasi Randomness." SIAM Journal on Discrete Mathematics 6, no. 1 (1993): 110–23. http://dx.doi.org/10.1137/0406009.

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

Kučera, Antonín, and André Nies. "Demuth randomness and computational complexity." Annals of Pure and Applied Logic 162, no. 7 (2011): 504–13. http://dx.doi.org/10.1016/j.apal.2011.01.004.

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

Blundo, C., A. De Santis, G. Persiano, and U. Vaccaro. "Randomness complexity of private computation." Computational Complexity 8, no. 2 (1999): 145–68. http://dx.doi.org/10.1007/s000370050025.

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

Zuchowski, Lena C. "Disentangling Complexity from Randomness and Chaos." Entropy 14, no. 2 (2012): 177–212. http://dx.doi.org/10.3390/e14020177.

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

Wang, Yongge. "Resource bounded randomness and computational complexity." Theoretical Computer Science 237, no. 1-2 (2000): 33–55. http://dx.doi.org/10.1016/s0304-3975(98)00119-4.

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

Barmpalias, George. "Algorithmic Randomness and Measures of Complexity." Bulletin of Symbolic Logic 19, no. 3 (2013): 318–50. http://dx.doi.org/10.1017/s1079898600010672.

Full text
Abstract:
AbstractWe survey recent advances on the interface between computability theory and algorithmic randomness, with special attention on measures of relative complexity. We focus on (weak) reducibilities that measure (a) the initial segment complexity of reals and (b) the power of reals to compress strings, when they are used as oracles. The results are put into context and several connections are made with various central issues in modern algorithmic randomness and computability.
APA, Harvard, Vancouver, ISO, and other styles
10

Wolynes, Peter G. "Randomness and complexity in chemical physics." Accounts of Chemical Research 25, no. 11 (1992): 513–19. http://dx.doi.org/10.1021/ar00023a005.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Randomness complexity"

1

Melkebeek, Dieter van. "Randomness and completeness in computational complexity." New York : Springer, 2000. http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=1950.

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

Eickmeyer, Kord. "Randomness in complexity theory and logics." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2011. http://dx.doi.org/10.18452/16364.

Full text
Abstract:
Die vorliegende Dissertation besteht aus zwei Teilen, deren gemeinsames Thema in der Frage besteht, wie mächtig Zufall als Berechnungsressource ist. Im ersten Teil beschäftigen wir uns mit zufälligen Strukturen, die -- mit hoher Wahrscheinlichkeit -- Eigenschaften haben können, die von Computeralgorithmen genutzt werden können. In zwei konkreten Fällen geben wir bis dahin unbekannte deterministische Konstruktionen solcher Strukturen: Wir derandomisieren eine randomisierte Reduktion von Alekhnovich und Razborov, indem wir bestimmte unbalancierte bipartite Expandergraphen konstruieren,
APA, Harvard, Vancouver, ISO, and other styles
3

Montanaro, Ashley. "Structure, randomness and complexity in quantum computation." Thesis, University of Bristol, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.443658.

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

Burrage, Alex J. "Complexity measures for classes of sequences and cryptographic applications." Thesis, Loughborough University, 2013. https://dspace.lboro.ac.uk/2134/11723.

Full text
Abstract:
Pseudo-random sequences are a crucial component of cryptography, particularly in stream cipher design. In this thesis we will investigate several measures of randomness for certain classes of finitely generated sequences. We will present a heuristic algorithm for calculating the k-error linear complexity of a general sequence, of either finite or infinite length, and results on the closeness of the approximation generated. We will present an linear time algorithm for determining the linear complexity of a sequence whose characteristic polynomial is a power of an irreducible element, again pres
APA, Harvard, Vancouver, ISO, and other styles
5

Kalyanasundaram, Subrahmanyam. "Turing machine algorithms and studies in quasi-randomness." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/42808.

Full text
Abstract:
Randomness is an invaluable resource in theoretical computer science. However, pure random bits are hard to obtain. Quasi-randomness is a tool that has been widely used in eliminating/reducing the randomness from randomized algorithms. In this thesis, we study some aspects of quasi-randomness in graphs. Specifically, we provide an algorithm and a lower bound for two different kinds of regularity lemmas. Our algorithm for FK-regularity is derived using a spectral characterization of quasi-randomness. We also use a similar spectral connection to also answer an open question about quasi-random to
APA, Harvard, Vancouver, ISO, and other styles
6

Eickmeyer, Kord [Verfasser], Martin [Akademischer Betreuer] Grohe, Nicole [Akademischer Betreuer] Schweikardt, and Miltersen Peter [Akademischer Betreuer] Bro. "Randomness in complexity theory and logics / Kord Eickmeyer. Gutachter: Martin Grohe ; Nicole Schweikardt ; Peter Bro Miltersen." Berlin : Humboldt Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2011. http://d-nb.info/1015169163/34.

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

Urrutia, Florent. "Information theory for multi-party peer-to-peer communication protocols." Thesis, Sorbonne Paris Cité, 2018. http://www.theses.fr/2018USPCC015/document.

Full text
Abstract:
Cette thèse a pour sujet les protocoles de communication peer-to-peer asynchrones. Nous introduisons deux mesures basées sur la théorie de l'information,la Public Information Complexity (PIC) et la Multi-party Information Complexity (MIC), étudions leurs propriétés et leur relation avec d'autres mesures fondamentales en calcul distribué, telles que la communication complexity et la randomness complexity. Nous utilisons ensuite ces deux mesures pour étudier la fonction parité et la fonction disjointness<br>This thesis is concerned with the study of multi-party communicationprotocols in the asyn
APA, Harvard, Vancouver, ISO, and other styles
8

Junior, Domingos Dellamonica. "Extração de aleatoriedade a partir de fontes defeituosas." Universidade de São Paulo, 2007. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-04052007-160412/.

Full text
Abstract:
Recentemente, Barak et al. (2004) exibiram construções de extratores e dispersores determinísticos (funções computáveis em tempo polinomial) com parâmetros melhores do que era anteriormente possível. Introduziremos os conceitos envolvidos em tal trabalho e mencionaremos suas aplicações; em particular, veremos como é possível obter cotas muito melhores para o problema Ramsey bipartido (um problema bem difícil) utilizando as construções descritas no artigo. Também apresentamos resultados originais para melhorar tais construções. Tais idéias são inspiradas no trabalho de Anup Rao (2005) e utiliz
APA, Harvard, Vancouver, ISO, and other styles
9

Gordan, Mimić. "Nelinearna dinamička analiza fizičkih procesa u žiivotnoj sredini." Phd thesis, Univerzitet u Novom Sadu, Prirodno-matematički fakultet u Novom Sadu, 2016. https://www.cris.uns.ac.rs/record.jsf?recordId=101258&source=NDLTD&language=en.

Full text
Abstract:
Ispitivan&nbsp; je&nbsp; spregnut&nbsp; sistem&nbsp; jednačina&nbsp; za&nbsp; prognozu&nbsp; temperature&nbsp; na povr&scaron;ini&nbsp; i&nbsp; u&nbsp; dubljem sloju zemlji&scaron;ta.&nbsp; Računati&nbsp; su&nbsp; Ljapunovljevi eksponenti,&nbsp; bifurkacioni dijagram, atraktor i analiziran je domen re&scaron;enja. Uvedene su nove informacione mere&nbsp; bazirane naKolmogorovljevoj kompleksnosti,&nbsp; za kvantifikaciju&nbsp; stepena nasumičnosti u vremenskim serijama,.&nbsp; Nove mere su primenjene na razne serije dobijene merenjem fizičkih faktora životne sredine i pomoću klimatskih modela.<b
APA, Harvard, Vancouver, ISO, and other styles
10

Monin, Benoît. "Higher computability and randomnes." Paris 7, 2014. http://www.theses.fr/2014PA077182.

Full text
Abstract:
Dans cette thèse, nous traitons principalement des notions d'aléatoirité d'ordre supérieur, notamment les notions de Delta ^1_1-aléatoirité, de Pi^1_1-Martin-Löf aléatoirité, de Pi^1_1- aléatoirité faible, et de Pi^1_1-aléatoirité, en mettant plus particulièrement l'accent sur cette dernière notion : la Pi^1_1-aléatoirité. L'étude de ces notions d'aléatoirité soulève plusieurs problématiques. Nous essayons notamment de comprendre les similarités et les différences entre toutes ces notions, mais aussi entre ces notions et les notions d'aléatoirités classiques, largement étudiées ces quinze dern
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Randomness complexity"

1

Roman, Hirschfeldt Denis, ed. Algorithmic randomness and complexity. Springer, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Downey, Rodney G., and Denis R. Hirschfeldt. Algorithmic Randomness and Complexity. Springer New York, 2010. http://dx.doi.org/10.1007/978-0-387-68441-3.

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

Computability and randomness. Oxford University Press, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Nies, André. Computability and randomness. Oxford University Press, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Randomness and completeness in computational complexity. Springer-Verlag, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

van Melkebeek, Dieter. Randomness and Completeness in Computational Complexity. Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-44545-5.

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

Zambelli, Stefano, and Donald A. R. George, eds. Nonlinearity, Complexity and Randomness in Economics. John Wiley & Sons, Ltd, 2012. http://dx.doi.org/10.1002/9781118300442.

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

Maass, Alejandro. Dynamics and Randomness. Springer Netherlands, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Randomness through computation: Some answers, more questions. World Scientific, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Information and randomness: An algorithmic perspective. Springer-Verlag, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Randomness complexity"

1

Novikov, Gleb. "Randomness Deficiencies." In Unveiling Dynamics and Complexity. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-58741-7_32.

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

Ramsden, Jeremy. "Randomness and Complexity." In Computational Biology. Springer London, 2015. http://dx.doi.org/10.1007/978-1-4471-6702-0_6.

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

Silvestri, Riccardo. "Randomness and Complexity." In The Power of Algorithms. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-39652-6_10.

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

Ramsden, Jeremy J. "Randomness and complexity." In Bioinformatics: An Introduction. Springer Netherlands, 2004. http://dx.doi.org/10.1007/978-1-4020-2950-9_6.

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

Ramsden, Jeremy J. "Randomness and complexity." In Computational Biology. Springer London, 2009. http://dx.doi.org/10.1007/978-1-84800-257-9_6.

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

Downey, Rodney G., and Denis R. Hirschfeldt. "Randomness-Theoretic Weakness." In Algorithmic Randomness and Complexity. Springer New York, 2010. http://dx.doi.org/10.1007/978-0-387-68441-3_11.

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

Downey, Rodney G., and Denis R. Hirschfeldt. "Martin-Löf Randomness." In Algorithmic Randomness and Complexity. Springer New York, 2010. http://dx.doi.org/10.1007/978-0-387-68441-3_6.

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

Atakan, Cemal, Rukiye Dağalp, Nihan Potas, and Fikri Öztürk. "Randomness and Chaos." In Chaos, Complexity and Leadership 2017. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-89875-9_51.

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

Downey, Rodney G., and Denis R. Hirschfeldt. "Measures of Relative Randomness." In Algorithmic Randomness and Complexity. Springer New York, 2010. http://dx.doi.org/10.1007/978-0-387-68441-3_9.

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

Beros, Achilles A., Mushfeq Khan, and Bjørn Kjos-Hanssen. "Effective Bi-immunity and Randomness." In Computability and Complexity. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-50062-1_38.

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

Conference papers on the topic "Randomness complexity"

1

Partovi, M. Hossein. "Algorithmic complexity and randomness." In The twentieth international workshop on bayesian inference and maximum entropy methods in science and engineering. AIP, 2001. http://dx.doi.org/10.1063/1.1381868.

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

Chung, Kai-Min, and Rafael Pass. "The Randomness Complexity of Parallel Repetition." In 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2011. http://dx.doi.org/10.1109/focs.2011.93.

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

Dubrov, Bella, and Yuval Ishai. "On the randomness complexity of efficient sampling." In the thirty-eighth annual ACM symposium. ACM Press, 2006. http://dx.doi.org/10.1145/1132516.1132615.

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

Furer, M. "The power of randomness for communication complexity." In the nineteenth annual ACM conference. ACM Press, 1987. http://dx.doi.org/10.1145/28395.28415.

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

Kinsner, W. "Single-Scale Measures for Randomness and Complexity." In 6th IEEE International Conference on Cognitive Informatics. IEEE, 2007. http://dx.doi.org/10.1109/coginf.2007.4341936.

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

LOZI, RENÉ. "COMPLEXITY LEADS TO RANDOMNESS IN CHAOTIC SYSTEMS." In Proceedings of the Satellite Conference of ICM 2010. WORLD SCIENTIFIC, 2011. http://dx.doi.org/10.1142/9789814338820_0005.

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

Guruswami, Venkatesan, Christopher Umans, and Salil Vadhan. "Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes." In Twenty-Second Annual IEEE Conference on Computational Complexity. IEEE, 2007. http://dx.doi.org/10.1109/ccc.2007.38.

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

Gavinsky, Dmitry, Tsuyoshi Ito, and Guoming Wang. "Shared Randomness and Quantum Communication in the Multi-party Model." In 2013 IEEE Conference on Computational Complexity (CCC). IEEE, 2013. http://dx.doi.org/10.1109/ccc.2013.13.

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

Ratsaby, J. "On complexity and randomness of Markov-chain prediction." In 2015 IEEE Information Theory Workshop (ITW). IEEE, 2015. http://dx.doi.org/10.1109/itw.2015.7133078.

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

Zimand, Marius. "Symmetry of Information and Bounds on Nonuniform Randomness Extraction via Kolmogorov Extractors." In 2011 IEEE Annual Conference on Computational Complexity (CCC). IEEE, 2011. http://dx.doi.org/10.1109/ccc.2011.21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Randomness complexity' for particular source types:
Journal articles Books
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!

To the bibliography