11151 search results - page 188 / 2231 » On the Complexity of Model Expansion |
161
Voted
CORR
2010
Springer
15 years 7 months ago
2010
Springer
: We prove that coNP MA in the number-on-forehead model of multiparty communication complexity for up to k = (1 - )logn players, where > 0 is any constant. Specifically, we con...
179
click to vote
JC
2008
15 years 7 months ago
2008
Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families. The basic computation model used is the arithmetic circuit, which ma...
162
click to vote
ISTA
2001
15 years 8 months ago
2001
: The simulation of technological process in the oil pipelines system is considered in the paper. The solution of the task meets a number of difficulties originating during control...
207
Voted
AAAI
1997
15 years 8 months ago
1997
Difficult real-time AI problems require a means for expressing multi-dimensional and dynamic goal criteria and a principled model for satisficing to best meet the criteria. In the...
172
click to vote
ITA
2000
15 years 6 months ago
2000
We consider the multiparty communication model de ned in 4] using the formalism from 8]. First, we correct an inaccuracy in the proof of the fundamental result of 6] providing a lo...