On the complexity of rankingHEMACHANDRA, L. A; RUDICH, S.Journal of computer and system sciences (Print). 1990, Vol 41, Num 2, pp 251-271, issn 0022-0000, 21 p.Article

Complexity, Networks, and Non-Uniqueness : Philosophy and ComplexityBAKER, Alan.Foundations of science. 2013, Vol 18, Num 4, pp 687-705, issn 1233-1821, 19 p.Article

Oracles for deterministic versus alternating classesGASARCH, W.SIAM journal on computing (Print). 1987, Vol 16, Num 4, pp 613-627, issn 0097-5397Article

Structural analysis of the complexity of inverse functionsWATANABE, O; TODA, S.Mathematical systems theory. 1993, Vol 26, Num 2, pp 203-214, issn 0025-5661Article

Complexity and Context-DependencyEDMONDS, Bruce.Foundations of science. 2013, Vol 18, Num 4, pp 745-755, issn 1233-1821, 11 p.Article

Machine characterizations of the classes of the W-hierarchyCHEN, Yijia; FLUM, Jörg.Lecture notes in computer science. 2003, pp 114-127, issn 0302-9743, isbn 3-540-40801-0, 14 p.Conference Paper

Computational capabilities of multilayer committee machinesNEIROTTI, J. P; FRANCO, L.Journal of physics. A, Mathematical and theoretical (Print). 2010, Vol 43, Num 44, issn 1751-8113, 445103.1-445103.26Article

La complexité comme sagesse, lucidité et liberté : Entrevue avec Jacques Zylberberg, Université Laval, QuébecLaflamme, Simon.Nouvelles perspectives en sciences sociales (En ligne). 2009, Vol 4, Num 2, pp 69-81, issn 1918-7475, 13 p.Article

Quasi-injective reductionsHEMASPAANDRA, E; HEMASPAANDRA, L. A.Theoretical computer science. 1994, Vol 123, Num 2, pp 407-413, issn 0304-3975Article

Lower bounds for the low hierarchyALLENDER, E; HEMACHANDRA, L. A.Journal of the Association for Computing Machinery. 1992, Vol 39, Num 1, pp 234-251, issn 0004-5411Article

Limiting characterizations of low level space complexity classesANGELACCIO, M; PROTASI, M.Informatique théorique et applications (Imprimé). 1993, Vol 27, Num 3, pp 175-182, issn 0988-3754Article

Kolmogorov characterizations of complexity classesHEMACHANDRA, L. A; WECHSUNG, G.Theoretical computer science. 1991, Vol 83, Num 2, pp 313-322, issn 0304-3975, 10 p.Article

Examining Organizational Functioning Through the Lens of Complexity Theory Using System Dynamics Modeling : Complexity Theory = Examiner le fonctionnement organisationnel à travers la loupe de la théorie de la complexité en utilisant le système de la modélisation dynamique : Théorie de la complexitéFITCH, Dale; JAGOLINO, Noel C.Journal of social service research. 2012, Vol 38, Num 5, pp 591-604, issn 0148-8376, 14 p.Article

Machine-based methods in parameterized complexity theoryYIJIA CHEN; FLUM, Jörg; GROHE, Martin et al.Theoretical computer science. 2005, Vol 339, Num 2-3, pp 167-199, issn 0304-3975, 33 p.Article

Complexity and palindromic defect of infinite wordsBRLEK, S; REUTENAUER, C.Theoretical computer science. 2011, Vol 412, Num 4-5, pp 493-497, issn 0304-3975, 5 p.Article

Complexity in social and cultural integration : Some analytical dimensionsHYLLAND ERIKSEN, Thomas.Ethnic and racial studies. 2007, Vol 30, Num 6, pp 1055-1069, issn 0141-9870, 15 p.Article

Almost-everywhere complexity hierarchies for nondeterministic timeALLENDER, E; BEIGEL, R; HERTRAMPF, U et al.Theoretical computer science. 1993, Vol 115, Num 2, pp 225-241, issn 0304-3975Article

Complexity classes for self-assembling flexible tilesJONOSKA, Natasa; MCCOLM, Gregory L.Theoretical computer science. 2009, Vol 410, Num 4-5, pp 332-346, issn 0304-3975, 15 p.Article

Effective dimensions of partially observed polytreesKOCKA, Tomas; ZHANG, Nevin L.Lecture notes in computer science. 2003, pp 184-195, issn 0302-9743, isbn 3-540-40494-5, 12 p.Conference Paper

An efficient algorithm for generating linear transformations in a shuffle-exchange networkETZION, T; LEMPEL, A.SIAM journal on computing (Print). 1986, Vol 15, Num 1, pp 216-221, issn 0097-5397Article

Summarizing complexity in high dimensionsYOUNG, Karl; YUE CHEN; KORNAK, John et al.Physical review letters. 2005, Vol 94, Num 9, pp 098701.1-098701.4, issn 0031-9007Article

Les chiffres de la complexité informatique: Prenons du recul sur la complexité. Où en sommes-nous ? Où allons-nous ? Tout est-il possible ? = The numbers of computer complexity: stepping back from the complexity for a better view. Where are we? Where do we go? is everything possible?DELAHAYE, Jean-Paul.Pour la science. 2003, Num 314, pp 162-167, issn 0153-4092, 6 p.Article

Construction of Sturmian sequencesKEBO LÜ; JUN WANG.Journal of physics. A, mathematical and general. 2005, Vol 38, Num 13, pp 2891-2897, issn 0305-4470, 7 p.Article

Rational index of context-free languages in exp^Θ(^Pνn) and n^ΘINN(1/P)PIERRE, L; FARINONE, J. M.Theoretical computer science. 1988, Vol 57, Num 2-3, pp 185-204, issn 0304-3975Article

Approximating fractional time quantum evolutionSHERIDAN, L; MASLOV, D; MOSCA, M et al.Journal of physics. A, Mathematical and theoretical (Print). 2009, Vol 42, Num 18, issn 1751-8113, 185302.1-185302.15Article