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

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

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

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

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

On the Import of Constraints in Complex Dynamical SystemsHOOKER, Cliff.Foundations of science. 2013, Vol 18, Num 4, pp 757-780, issn 1233-1821, 24 p.Article

On the complexity of deciding bimatrix games similarityYE DU.Theoretical computer science. 2008, Vol 407, Num 1-3, pp 583-586, issn 0304-3975, 4 p.Article

Annual Workshop on Computational Learning Theory (COLT) 1994Journal of computer and system sciences (Print). 1996, Vol 52, Num 3, pp 393-492, issn 0022-0000Conference Proceedings

Non-deterministic communication complexity with few witnessesKARCHMER, M; NEWMAN, I; SAKS, M et al.Journal of computer and system sciences (Print). 1994, Vol 49, Num 2, pp 247-257, issn 0022-0000Article

A note on separating the relativized polynomial time hierarchy by immune setsKO, K.-I.Informatique théorique et applications (Imprimé). 1990, Vol 24, Num 3, pp 229-240, issn 0988-3754, 12 p.Article

Descriptive characterizations of computational complexityLEIVANT, D.Journal of computer and system sciences (Print). 1989, Vol 39, Num 1, pp 51-83, issn 0022-0000Article

Musings About BeautyKINTSCH, Walter.Cognitive science. 2012, Vol 36, Num 4, pp 635-654, issn 0364-0213, 20 p.Article

Évolution, complexité et métahistoricismeKrakauer, David C.Nouvelles perspectives en sciences sociales (En ligne). 2009, Vol 4, Num 2, pp 53-67, issn 1918-7475, 15 p.Article

Limitations of the upward separation techniqueALLENDER, E.Mathematical systems theory. 1991, Vol 24, Num 1, pp 53-67, issn 0025-5661, 15 p.Article

Beyond continuous mathematics and traditional scientific analysis: Understanding and mining Wolfram's A New Kind of ScienceMCDOWELL, J. J; POPA, Andrei.Behavioural processes. 2009, Vol 81, Num 2, pp 343-352, issn 0376-6357, 10 p.Article

Error-bounded probabilistic computations between MA and AMBÖHLER, Elmar; GLASSER, Christian; MEISTER, Daniel et al.Lecture notes in computer science. 2003, pp 249-258, issn 0302-9743, isbn 3-540-40671-9, 10 p.Conference Paper

Boolean NP-partitions and projective closureKOSUB, Sven.Lecture notes in computer science. 2003, pp 225-236, issn 0302-9743, isbn 3-540-40505-4, 12 p.Conference Paper

The complexity of malign measuresBRO MILTERSEN, P.SIAM journal on computing (Print). 1993, Vol 22, Num 1, pp 147-156, issn 0097-5397Article

On the p-isomorphism conjectureWATANABE, O.Theoretical computer science. 1991, Vol 83, Num 2, pp 337-343, issn 0304-3975, 7 p.Article

Bounded query classesWAGNER, K. W.SIAM journal on computing (Print). 1990, Vol 19, Num 5, pp 833-846, issn 0097-5397, 14 p.Article

An explicit separation of relativised random polynomial time and relativised deterministic polynomial timeZIPPEL, R.Information processing letters. 1989, Vol 33, Num 4, pp 207-212, issn 0020-0190Article

Stigmergy 3.0: From ants to economiesSUN, Ron; DOYLE, Margery J; MARSH, Leslie et al.Cognitive systems research (Print). 2013, Num 21, pp 1-6, issn 2214-4366, 6 p.Article