16666 search results - page 2539 / 3334 » Descriptive and Computational Complexity |
200
click to vote
IPPS
1999
IEEE
15 years 12 months ago
1999
IEEE
In order for parallel logic programming systems to become popular, they should serve the broadest range of applications. To achieve this goal, designers of parallel logic programm...
213
click to vote
COCO
1999
Springer
15 years 12 months ago
1999
Springer
Recent work by Bernasconi, Damm and Shparlinski showed that the set of square-free numbers is not in AC0 , and raised as an open question whether similar (or stronger) lower bound...
183
click to vote
COCOON
1999
Springer
15 years 12 months ago
1999
Springer
Cai and Selman [CS99] defined a modification of Levin’s notion of average polynomial time and proved, for every P-bi-immune language L and every polynomial-time computable dis...
194
click to vote
ISCAS
1999
IEEE
15 years 12 months ago
1999
IEEE
This paper considers the minimax filtering problem in which the supremum norm of weighted error sequence is minimized. It is shown that the minimax solution is also the optimal Se...
210
click to vote
CONCUR
1999
Springer
15 years 12 months ago
1999
Springer
In order to check whether an open system satisfies a desired property, we need to check the behavior of the system with respect to an arbitrary environment. In the most general se...