The common use of several disciplines for the realization of practical purposes and their usual coworking favour such meetings involving different disciplines. Some old and recent successful examples ...of effective interferences between different disciplines are reported in order to evidence the potential fruitfulness of this process. The theme complexity and disorder are shown to be a central point of convergence between disciplines shown from the observation of past and future projects.
New generalized cyclotomic binary sequences of period p2 are proposed in this paper, where p is an odd prime. The sequences are almost balanced and their linear complexity is determined. The result ...shows that the proposed sequences have very large linear complexity if p is a non-Wieferich prime.
Complexity science-made possible by modern analytical and computational advances-is changing the way we think about social systems and social theory. Unfortunately, economists' policy models have not ...kept up and are stuck in either a market fundamentalist or government control narrative. While these standard narratives are useful in some cases, they are damaging in others, directing thinking away from creative, innovative policy solutions.Complexity and the Art of Public Policyoutlines a new, more flexible policy narrative, which envisions society as a complex evolving system that is uncontrollable but can be influenced.
David Colander and Roland Kupers describe how economists and society became locked into the current policy framework, and lay out fresh alternatives for framing policy questions. Offering original solutions to stubborn problems, the complexity narrative builds on broader philosophical traditions, such as those in the work of John Stuart Mill, to suggest initiatives that the authors call "activist laissez-faire" policies. Colander and Kupers develop innovative bottom-up solutions that, through new institutional structures such as for-benefit corporations, channel individuals' social instincts into solving societal problems, making profits a tool for change rather than a goal. They argue that a central role for government in this complexity framework is to foster an ecostructure within which diverse forms of social entrepreneurship can emerge and blossom.
This article traces the life and work of architect Lina Bo Bardi to explore the more humane, free, unprejudiced and playful side of her architectural work. This will lead us to unveil a much more ...complex past than one might initially think, where the architect applies a particular human sensitivity that is perceptible in all of her work and where people stand at the centre of her priorities. Behind her wild fantasy and imagination lies the complexity and depth of focused, conscientious, coherent, self-critical and socially committed work. This has produced an open, porous architecture that ties in the joy and unpredictable essence of everyday life, nourishing collective spaces and embracing people's way of life.
Monotone measures of statistical complexity Rudnicki, Łukasz; Toranzo, Irene V.; Sánchez-Moreno, Pablo ...
Physics letters. A,
01/2016, Letnik:
380, Številka:
3
Journal Article
Recenzirano
Odprti dostop
•The notion of monotonicity of the complexity measure of a probability distribution is introduced and discussed.•The monotonicity properties of statistical measures of complexity are studied.•The ...Cramer–Rao and Fisher–Shannon measures of complexity are shown to be monotone.
We introduce and discuss the notion of monotonicity for the complexity measures of general probability distributions, patterned after the resource theory of quantum entanglement. Then, we explore whether this property is satisfied by the three main intrinsic measures of complexity (Crámer–Rao, Fisher–Shannon, LMC) and some of their generalizations.
Oracle separation of BQP and PH Raz, Ran; Tal, Avishay
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing,
06/2019
Conference Proceeding
Recenzirano
Odprti dostop
We present a distribution D over inputs in {−1,1}2N, such that: (1) There exists a quantum algorithm that makes one (quantum) query to the input, and runs in time O(logN), that distinguishes between ...D and the uniform distribution with advantage Ω(1/logN). (2) No Boolean circuit of quasi-polynomial size and constant depth distinguishes between D and the uniform distribution with advantage better than polylog(N)/√N.
By well known reductions, this gives a separation of the classes Promise-BQP and Promise-PH in the black-box model and implies an oracle O relative to which BQPO ⊈PHO.
Organizations have to cope with the complexity of their environment in order to survive. A considerable body of research has shown that organizations may respond to environmental complexity by ...creating internal complexity – for example, by expanding internal structures and processes. However, researchers know less about how organizations create collaborative complexity collectively – for example, by establishing alliances or developing common standards. This paper uses social systems theory to explore how organizations collaborate in response to complexity and to analyse the conditions under which they create either internal or collaborative complexity (or both) to address environmental complexity. It also examines how these types of complexity feed back into environmental complexity. To illustrate our conceptual model, we use corporate social responsibility (CSR).
We propose a diagonalization-based approach to several important questions in proof complexity. We illustrate this approach in the context of the algebraic proof system IPS and in the context of ...propositional proof systems more generally.
We use the approach to give an explicit sequence of CNF formulas {φn} such that VNP ≠ VP iff there are no polynomial-size IPS proofs for the formulas φn. This provides a natural equivalence between proof complexity lower bounds and standard algebraic complexity lower bounds. Our proof of this fact uses the implication from IPS lower bounds to algebraic complexity lower bounds due to Grochow and Pitassi together with a diagonalization argument: the formulas φn themselves assert the non-existence of short IPS proofs for formulas encoding VNP ≠ VP at a different input length. Our result also has meta-mathematical implications: it gives evidence for the difficulty of proving strong lower bounds for IPS within IPS.
For any strong enough propositional proof system R, we define the *iterated R-lower bound formulas*, which inductively assert the non-existence of short R proofs for formulas encoding the same statement at a different input length, and propose them as explicit hard candidates for the proof system R. We observe that this hypothesis holds for Resolution following recent results of Atserias and Muller and of Garlik, and give evidence in favour of it for other proof systems.
In this letter, we propose low-complexity linear equalizers for orthogonal time frequency space (OTFS) modulation that exploit the structure of the effective channel matrix in OTFS. The proposed ...approach exploits the block circulant nature of the OTFS channel matrix to achieve significant complexity reduction. For an N × M OTFS system, where N and M are the number of Doppler and delay bins, respectively, the proposed approach gives exact minimum mean square error (MMSE) and zero-forcing (ZF) solutions with just O(MN log MN) complexity, while MMSE and ZF solutions using the traditional matrix inversion approach require O(M 3 N 3 ) complexity. The proposed approach can provide low complexity initial solutions for local search techniques to achieve enhanced bit error performance.
PDF
