1445 search results - page 57 / 289 » Uniformly Hard Languages |
FOCS
2000
IEEE
14 years 2 months ago
2000
IEEE
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
JAIR
1998
13 years 9 months ago
1998
A class of interval-based temporal languages for uniformly representing and reasoning about actions and plans is presented. Actions are represented by describing what is true whil...
CORR
2011
Springer
13 years 5 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
CIE
2007
Springer
14 years 4 months ago
2007
Springer
This paper introduces two complexity-theoretic formulations of Bennett’s computational depth: finite-state depth and polynomial-time depth. It is shown that for both formulation...
SP
2000
IEEE
14 years 1 months ago
2000
IEEE
Tradeoffs are an important part of engineering security. Protocol security is important. So are efficiency and cost. This paper provides an early framework for handling such aspec...