635 search results - page 36 / 127 » Some Computational Problems Related to Pseudo-intents |
175
click to vote
DNA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Laboratory investigations have shown that a formal theory of fault-tolerance will be essential to harness nanoscale self-assembly as a medium of computation. Several rese...
151
Voted
COLT
2007
Springer
16 years 28 days ago
2007
Springer
When comparing discrete probability distributions, natural measures of similarity are not p distances but rather are informationdivergences such as Kullback-Leibler and Hellinger. ...
179
Voted
LFCS
1994
Springer
15 years 10 months ago
1994
Springer
In a previous paper [4], we introduced a non-deterministic -calculus (-LK) whose type system corresponds exactly to Gentzen's cut-free LK [9]. This calculus, however, cannot b...
182
Voted
ICS
2010
Tsinghua U.
16 years 4 months ago
2010
Tsinghua U.
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
140
click to vote
AIPS
2009
15 years 7 months ago
2009
While several powerful domain-independent planners have recently been developed, no one of these clearly outperforms all the others in every known benchmark domain. We present PbP...