196 search results - page 38 / 40 » A finite set of functions with an EXPTIME-complete compositi... |
ECCC
2008
14 years 9 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...
LACL
2001
Springer
15 years 1 months ago
2001
Springer
In categorial systems with a fixed structural component, the learning problem comes down to finding the solution for a set of typeassignment equations. A hard-wired structural co...
181
click to vote
POPL
2009
ACM
15 years 10 months ago
2009
ACM
This work develops an integrated approach to the verification of behaviourally rich programs, founded directly on operational semantics. The power of the approach is demonstrated ...
MODELS
2009
Springer
15 years 4 months ago
2009
Springer
Product line engineering is an emerging paradigm of developing a family of products. While product line analysis and design mainly focus on reasoning about commonality and variabi...
85
Voted
STOC
2010
ACM
15 years 2 months ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...