1670 search results - page 216 / 334 » On Skolemization in constructive theories |
169
click to vote
FOCS
2008
IEEE
16 years 27 days ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
160
click to vote
APPROX
2004
Springer
15 years 12 months ago
2004
Springer
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
173
click to vote
MCU
2004
15 years 7 months ago
2004
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram's "Principle of Computational Equivale...
268
click to vote
POPL
2008
ACM
16 years 6 months ago
2008
ACM
GADTs are at the cutting edge of functional programming and become more widely used every day. Nevertheless, the semantic foundations underlying GADTs are not well understood. In ...
281
click to vote
POPL
2005
ACM
16 years 6 months ago
2005
ACM
Despite the extensiveness of recent investigations on static typing for XML, parametric polymorphism has rarely been treated. This well-established typing discipline can also be u...