Results 241 to 250 of about 8,682,077 (303)
Some of the next articles are maybe not open access.
Exploring the Relevance of Complexity Theory for Mixed Methods Research
Journal of Mixed Methods Research, 2020While the field of mixed methods has discussed complexity theory, more clarification regarding its conceptualization is needed. Accordingly, we first review how various fields have interpreted and applied the central ideas of complexity theory in the ...
Leanne M. Kallemeyn +2 more
semanticscholar +1 more source
ACM SIGACT News, 2001
We present high-level technical summaries of five recent results on the computational complexity of the shortest lattice vector problem.
openaire +1 more source
We present high-level technical summaries of five recent results on the computational complexity of the shortest lattice vector problem.
openaire +1 more source
Testing complexity theory in service research
Journal of Services Marketing, 2019Purpose This study aims to draw on the complexity theory and uses a non-an asymmetrical method – fuzzy-set qualitative comparative analysis (fsQCA) to test the core tenets of complexity theory, namely, asymmetry, equifinality and causal complexity and ...
C. Prentice
semanticscholar +1 more source
Complexity Theory for Discrete Black-Box Optimization Heuristics
Theory of Evolutionary Computation, 2018A predominant topic in the theory of evolutionary algorithms and, more generally, theory of randomized black-box optimization techniques is running-time analysis.
Carola Doerr
semanticscholar +1 more source
Complexity Theory and Algorithms
2000This workshop embraces algorithmic and complexity theory issues in parallel computing. A total of 10 submissions were received. Three papers were accepted, two as regular papers, one as a research note.
Friedhelm Meyer auf der Heide +2 more
openaire +1 more source
Results in Mathematics, 2005
Given \(A(z)\) entire, it is well known that all solutions of \[ y^{(k)}+A(z)y=0 \] are entire functions. The main result in the present paper is the following theorem: Suppose \(\rho(A)
openaire +2 more sources
Given \(A(z)\) entire, it is well known that all solutions of \[ y^{(k)}+A(z)y=0 \] are entire functions. The main result in the present paper is the following theorem: Suppose \(\rho(A)
openaire +2 more sources
Perspective: Complexity Theory and Organization Science
Organization science (Providence, R.I.), 1999Complex organizations exhibit surprising, nonlinear behavior. Although organization scientists have studied complex organizations for many years, a developing set of conceptual and computational tools makes possible new approaches to modeling nonlinear ...
Gérard P. Cachon +2 more
semanticscholar +1 more source
Epistemologia. Rivista italiana di filosofia della scienza
From a formalist standpoint, the identity-relation is indifferent to the nature of its terms. In contrast, from a Hegelian standpoint, the properties of identity have their source in the kind of entity over which individual variables range. The author tries to capture the latter more logically complex, and ontologically differentiated, view in terms of
openaire +2 more sources
From a formalist standpoint, the identity-relation is indifferent to the nature of its terms. In contrast, from a Hegelian standpoint, the properties of identity have their source in the kind of entity over which individual variables range. The author tries to capture the latter more logically complex, and ontologically differentiated, view in terms of
openaire +2 more sources
Economic complexity theory and applications
Nature Reviews Physics, 2021César A. Hidalgo
semanticscholar +1 more source
Computational Complexity Theory
2004Week One: Complexity theory: From Godel to Feynman Complexity theory: From Godel to Feynman History and basic concepts Resources, reductions and P vs. NP Probabilistic and quantum computation Complexity classes Space complexity and circuit complexity Oracles and the polynomial time hierarchy Circuit lower bounds "Natural" proofs of lower bounds ...
openaire +1 more source