1507 search results - page 73 / 302 » Separating Complexity Classes Using Structural Properties |
ECCC
2008
13 years 10 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
CDC
2009
IEEE
14 years 2 months ago
2009
IEEE
— In this paper, the safety control problem for a class of hybrid systems with disturbance inputs and imperfect continuous state information is considered. Under the assumption t...
EUROGP
2004
Springer
14 years 1 months ago
2004
Springer
Most programs currently written by humans are object-oriented ones. Two of the greatest benefits of object oriented programming are the separation of interface from implementation,...
STOC
1994
ACM
14 years 2 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 ...
BMCBI
2004
13 years 9 months ago
2004
Background: The proliferation of structural and functional studies of RNA has revealed an increasing range of RNA's structural repertoire. Toward the objective of systematic ...