16666 search results - page 329 / 3334 » Descriptive and Computational Complexity |
171
click to vote
CSR
2006
Springer
15 years 10 months ago
2006
Springer
We classify the computational complexity of all constraint satisfaction problems where the constraint language is preserved by all permutations of the domain. A constraint languag...
158
click to vote
PRICAI
2000
Springer
15 years 10 months ago
2000
Springer
The automated prediction of a user's interests and requirements is an area of interest to the Artificial Intelligence community. However, current predictive statistical approa...
186
click to vote
QOSA
2010
Springer
15 years 8 months ago
2010
Springer
The use of redundant computational nodes is a widely used design tactic to improve the reliability of complex embedded systems. However, this redundancy allocation has also an effe...
165
click to vote
JUCS
2008
15 years 6 months ago
2008
: Given a probability measure and a positive integer n. How to choose n knots and n weights such that the corresponding quadrature rule has the minimum worst-case error when appli...
172
click to vote
CC
2005
Springer
15 years 6 months ago
2005
Springer
We study the complexity of constructing pseudorandom generators (PRGs) from hard functions, focussing on constant-depth circuits. We show that, starting from a function f : {0, 1}l...