搜索结果: 46-60 共查到“理学 Complexity”相关记录130条 . 查询时间(0.046 秒)
The computational complexity of recognising embeddings in finitely presented groups
Finitely presented groups embeddings Kleene’s arithmetical hierarchy decidability universal finitely presented group
2011/8/29
Abstract: We extend a result by Lempp that recognising torsion-freeness for finitely presented groups is $\Pi^{0}_{2}$-complete; we show that the problem of recognising embeddings of finitely presente...
Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
Bilinear complexity of algebras Chudnovsky-Chudnovsky interpolation method Computational Complexity
2011/9/29
Abstract: We give new improvements to the Chudnovsky-Chudnovsky method that provides upper bounds on the bilinear complexity of multiplication in extensions of finite fields through interpolation on a...
Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials
Computational complexity Arithmetic circuits Determinant versus permanent Elementary symmetric polynomial
2012/12/3
The determinantal complexity of a polynomial f (x1, x2, . . . , xn) is the minimum m such that f = detm(L(x1, x2, . . . , xn)), where L(x1, x2, . . . , xn) is a matrix whose entries are affine forms i...
Modelling Complexity: the case of Climate Science
Uncertainty, Probability, Climate Models, Climate Change, Climate Variability, Spatial scales, Time scales, Chaos, Numerical Methods, Irreversibility, Entropy Production, Energy Balance
2011/8/30
We briefly review some of the scientific challenges and epistemological issues related to climate science. We discuss the formulation and testing of theories and numerical models, which, given the pre...
Network MIMO with Linear Zero-Forcing Beamforming: Large System Analysis, Impact of Channel Estimation and Reduced-Complexity Scheduling
Linear Zero-Forcing Beamforming Large System Analysis Impact of Channel Estimation Reduced-Complexity Scheduling
2011/2/21
We consider the downlink of a multi-cell system with multi-antenna base stations and single-antenna user terminals, arbitrary base station cooperation clusters, distance-dependent propagation pathloss...
Asymptotic invariants, complexity of groups and related problems
word problem conjugacy problem computational complexity
2011/1/19
We survey results about computational complexity of the word problem in groups, Dehn functions of groups and related problems.
Complexity of minimize total weighted average completion time scheduling problems with release times
flow-shop scheduling problem transportation delays
2010/9/20
The paper considers the problem of scheduling n jobs in a two-machine flow-shop to minimize the weighted sum of completion times. Between the completion of an operation and the beginning of the next o...
Duality Gap, Computational Complexity and NP Completeness: A Survey
Duality Gap Computational Complexity NP Completeness
2011/2/28
In this paper, we survey research that studies the connection between the computational complexity of optimization problems on the one hand, and the duality gap between the primal and dual optimizatio...
The subword complexity of smooth words on 2-letter alphabets
Derivative height smooth word LFE word
2011/2/21
Let a,b(n) be the number of smooth words of length n over the alphabet {a, b} with a < b. Say that a smooth word w is left fully extendable (LFE) if both aw and bw are smooth.
A measure of statistical complexity based on predictive information
measure of statistical complexity predictive information
2011/1/19
We introduce an information theoretic measure of statistical structure, called ‘binding informa-tion’, for sets of random variables, and compare it with several previously proposed measures in-cluding...
The Complexity of Approximately Counting Stable Roommate Assignments
Complexity of Approximately Stable Roommate Assignments
2011/3/2
We investigate the complexity of approximately counting stable room-mate assignments in two models: (i) the k-attribute model, in which the preference lists are determined by dot products of “preferen...
Towards a Low-Complexity Dynamic Decode-and-Forward Relay Protocol
Low-Complexity Dynamic Decode-and-Forward Relay Protocol
2011/1/17
The dynamic decode-and-forward (DDF) relaying protocol is a relatively new cooperative scheme
which has been shown to achieve promising theoretical results in terms of diversity-multiplexing gain tra...
Pair-wise Markov Random Fields Applied to the Design of Low Complexity MIMO Detectors
Pair-wise Markov Random Fields Design Low Complexity MIMO Detectors
2010/11/24
Pair-wise Markov random fields (MRF) are considered for application to the development of low complexity, iterative MIMO detection. Specifically, we consider two types of MRF, namely, the fully-conne...
Higher-order Fourier analysis of $\mathbb{F}_p^n$ and the complexity of systems of linear forms
Higher-order Fourier analysis linear forms
2010/11/24
Consider a subset $A$ of $\mathbb{F}_p^n$ and a decomposition of its indicator function as the sum of two bounded functions $1_A=f_1+f_2$. For every family of linear forms, we find the smallest degre...
Orientable closed 3-manifolds with surface-complexity one
3-manifolds surface-complexity one
2010/11/23
After a short summary of known results on surface-complexity of closed 3-manifolds, we will classify all closed orientable 3-manifolds with surface-complexity one.