392 search results - page 61 / 79 » Reversal Complexity Revisited |
JSYML
2007
13 years 8 months ago
2007
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
SIGSOFT
2008
ACM
14 years 9 months ago
2008
ACM
Program specifications are important for many tasks during software design, development, and maintenance. Among these, temporal specifications are particularly useful. They expres...
FOCS
1995
IEEE
14 years 5 days ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
ICCD
2007
IEEE
14 years 5 months ago
2007
IEEE
Software integrity and confidentiality play a central role in making embedded computer systems resilient to various malicious actions, such as software attacks; probing and tamper...
ICCAD
2001
IEEE
14 years 5 months ago
2001
IEEE
In this paper, we present novel algorithms that effectively combine physical layout and early logic synthesis to improve overall design quality. In addition, we employ partitionin...