3415 search results - page 348 / 683 » Lower bounds on kernelization |
160
click to vote
VLSID
1994
IEEE
15 years 10 months ago
1994
IEEE
In this paper, we present a formal analysis of the constraints of the scheduling problem, and evaluate the structure of the scheduling polytope described by those constraints. Pol...
165
click to vote
COLT
1994
Springer
15 years 10 months ago
1994
Springer
Realistic domains for learning possess regularities that make it possible to generalize experience across related states. This paper explores an environment-modeling framework tha...
185
click to vote
ICCI
1993
15 years 10 months ago
1993
The notion of interval sets is introduced as a new kind of sets, represented by a pair of sets, namely, the lower and upper bounds. The interval-set algebra may be regarded as a c...
159
click to vote
STOC
1994
ACM
15 years 10 months ago
1994
ACM
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandomnumber generators do not exist. This famous result is ...
134
click to vote
WG
1992
Springer
15 years 10 months ago
1992
Springer
The recognition complexityof ordered set properties is considered, i.e.how many questions have to be asked to decide if an unknown ordered set has a prescribed property. We prove ...