搜索结果: 61-75 共查到“知识库 理学 Complexity”相关记录121条 . 查询时间(0.603 秒)
Why Philosophers Should Care About Computational Complexity
quantum computing omniscience bounded rationality PAC-learning computationalism
2011/9/7
One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little further philosophical importance. In this essay, I offer a detailed c...
An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
Optimal Lower Bound Communication Complexity Gap-Hamming-Distance
2010/12/15
We prove an optimal W(n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal multi-pass space lower...
Phase-space characterization of complexity in quantum many-body dynamics
Phase-space characterization complexity quantum many-body dynamics
2010/10/18
We propose a phase-space Wigner harmonics entropy measure for many-body quantum dynamical
complexity. This measure, which reduces to the well known measure of complexity in classical
systems and whi...
Reduced Complexity Decoding for Bit-Interleaved Coded Multiple Beamforming with Constellation Precoding
Complexity Decoding Bit-Interleaved Coded Multiple Beamforming Constellation Precoding
2010/12/8
Multiple beamforming is realized by singular value decomposition of the channel matrix which is assumed to be perfectly known to the transmitter as well as the receiver. Bit-Interleaved Coded Multiple...
Linear Transceiver Design for Interference Alignment: Complexity and Computation
Linear Transceiver Interference Alignment: Complexity Computation
2010/12/8
Consider a MIMO interference channel whereby each transmitter and receiver are equipped with
multiple antennas. The basic problem is to design optimal linear transceivers (or beamformers) that can ma...
Completing Aronov et al.’s study on zero-discrepancymatrices for digital halftoning, we determine all (m, n, k, l) for which it is possible to put mn consecutive integers on an m × n board (with wrap-...
On Complexity of Isoperimetric Problems on Trees
isoperimetric number Cheeger constant normalized cut graph partitioning
2010/12/15
This paper is aimed to investigate some computational aspects of different isoperi-metric problems on weighted trees. In this regard, we consider different connectivity pa-rameters called minimum norm...
Complexity and Stochastic Synchronization in Coupled Map Lattices and Cellular Automata
Complexity Stochastic Synchronization Coupled Map Lattices Cellular Automata
2010/12/15
Nowadays the question ‘what is complexity?’ is a challenge to be answered. This question
is triggering a great quantity of works in the frontier of physics, biology, mathematics and
computer science...
Kolmogorov complexity, Lovasz local lemma and critical exponents
Kolmogorov complexity Lovasz local lemma critical exponents
2010/12/13
D. Krieger and J. Shallit have proved that every real number greater than 1 is a critical exponent of some sequence [1].We show how this result can be derived from some general statements about sequen...
Cox rings of rational complexity one T-varieties
Cox ring branched coverings torus actions
2010/11/29
Let X be a Mori dream space together with an effective torus action of complexity one. In this note, we construct a polyhedral divisor DCox on a suitable finite covering of P1 which corresponds to the...
Forbidden substrings, Kolmogorov complexity and almost periodic sequences
Forbidden substrings Kolmogorov complexity almost periodic sequences
2010/12/10
Assume that for some < 1 and for all nutural n a set Fn of at most 2 n “forbidden” binary strings of length n is fixed. Then there exists an infinite binary sequence ! that does not have (long) forb...
Higher topological complexity and homotopy dimension of configuration spaces on spheres
Lusternik-Schnirelmann category Schwarz genus topological complexity configuration spaces hyperplane arrangements
2010/12/3
In the paper “On Higher Analogs of Topological Complexity”Yu. Rudyak introduced the concept of TCn(X), the nth topological complexity of a path-connected space X. This concept was developed as a gener...
Statistical mechanics of classical and quantum computational complexity
Statistical mechanics classical quantum computational
2010/10/22
The quest for quantum computers is motivated by their potential for solving problems that defy
existing, classical, computers. The theory of computational complexity, one of the crown jewels of compu...
Complexity of Creative Telescoping for Bivariate Rational Functions
Hermite reduction creative telescoping
2013/9/3
The long-term goal initiated in this work is to obtain fast algorithms and implementations for definite integration in Almkvist and Zeilberger’s framework of (differential) creative telescoping. Our c...
Parallelized Solution to Semidefinite Programmings in Quantum Complexity Theory
Parallelized Solution Semidefinite Programmings Quantum Complexity Theory
2010/10/19
In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale’s thesis [Kal07]. One of the main adv...