258 search results - page 19 / 52 » Some Notes on Fine Computability |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...
IPL
2002
14 years 9 months ago
2002
This note reports on the number of s-partitions of a natural number n. In an s-partition of n each cell has the form 2k - 1 for some integer k. Such partitions have potential appl...
CIBCB
2005
IEEE
15 years 3 months ago
2005
IEEE
- Establishing structure-function relationships on the proteomic scale is a unique challenge faced by bioinformatics and molecular biosciences. Large protein families represent nat...
SEC
2008
14 years 11 months ago
2008
This paper presents FOXP (computer FOrensic eXPerience), an open source project to support network Live Digital Forensics (LDF), where the network nodes run a Windows NT family Ope...
TPHOL
1997
IEEE
15 years 1 months ago
1997
IEEE
This note lists references which address –in some way or another– the problems relating to formal manipulation of logical expressions where terms can fail to denote. Reference...