Results 11 to 20 of about 5,731,333 (141)

Consciousness complexity [PDF]

open access: yes, 2015
Copyright © 2015 by author and Scientific Research Publishing Inc. This work is licensed under the Creative Commons Attribution International License (CC BY).
Osman, M
core   +1 more source

Time complexity and gate complexity

open access: yes, 2010
We formulate and investigate the simplest version of time-optimal quantum computation theory (t-QCT), where the computation time is defined by the physical one and the Hamiltonian contains only one- and two-qubit interactions.
D. J. Tannor   +5 more
core   +1 more source

An Unintended Effect of Financing the University Education of the Most Brilliant and Poorest Colombian Students: The Case of the Intervention of the Ser Pilo Paga Program

open access: yesComplexity, 2018
In this paper, we show an unintended effect of the program Ser Pilo Paga (SPP) that was a flagship program of the Colombian government between 2014 and 2018.
Pablo Medina   +7 more
doaj   +1 more source

Hamiltonian complexity

open access: yes, 2011
In recent years we've seen the birth of a new field known as hamiltonian complexity lying at the crossroads between computer science and theoretical physics.
Osborne, Tobias J.
core   +1 more source

Robust Adaptive Fuzzy Control of Chaos in the Permanent Magnet Synchronous Motor

open access: yesDiscrete Dynamics in Nature and Society, 2010
An adaptive fuzzy control method is developed to control chaos in the permanent magnet synchronous motor drive system via backstepping. Fuzzy logic systems are used to approximate unknown nonlinearities, and an adaptive backstepping technique is employed
Jinpeng Yu   +4 more
doaj   +1 more source

Restricted Complexity, General Complexity [PDF]

open access: yes, 2006
Why has the problematic of complexity appeared so late?
Morin, Edgar
core   +2 more sources

On Descriptive Complexity, Language Complexity, and GB [PDF]

open access: yes, 1995
We introduce $L^2_{K,P}$, a monadic second-order language for reasoning about trees which characterizes the strongly Context-Free Languages in the sense that a set of finite trees is definable in $L^2_{K,P}$ iff it is (modulo a projection) a Local Set ...
Rogers, James
core   +3 more sources

Algorithms and Bounds for Very Strong Rainbow Coloring

open access: yes, 2018
A well-studied coloring problem is to assign colors to the edges of a graph $G$ so that, for every pair of vertices, all edges of at least one shortest path between them receive different colors.
Algorithms and Complexity   +8 more
core   +1 more source

Inequality in economic shock exposures across the global firm-level supply network

open access: yesNature Communications
For centuries, national economies have been engaging in international trade and production. The resulting international supply networks not only increase wealth for countries, but also allow for economic shocks to propagate across borders.
Abhijit Chakraborty   +4 more
doaj   +1 more source

Quantum Certificate Complexity [PDF]

open access: yes, 2002
Given a Boolean function f, we study two natural generalizations of the certificate complexity C(f): the randomized certificate complexity RC(f) and the quantum certificate complexity QC(f). Using Ambainis' adversary method, we exactly characterize QC(f)
Aaronson, Scott
core   +6 more sources

Home - About - Disclaimer - Privacy