1717 search results - page 330 / 344 » A Computable Spectral Theorem |
109
click to vote
BICOB
2010
Springer
15 years 5 months ago
2010
Springer
In this paper we investigate the structure and representation of n-ary algebras arising from DNA recombination, where n is a number of DNA segments participating in recombination. ...
CSR
2010
Springer
15 years 5 months ago
2010
Springer
Algorithmic tools for graphs of small treewidth are used to address questions in complexity theory. For both arithmetic and Boolean circuits, it is shown that any circuit of size ...
118
click to vote
NEUROSCIENCE
2001
Springer
15 years 4 months ago
2001
Springer
During odour recognition, excitatory and inhibitory groups of neurons in the second stage of the locust olfactory system, the antennal lobe (AL), fire alternately. There is little...
118
click to vote
ICS
2010
Tsinghua U.
15 years 4 months ago
2010
Tsinghua U.
: Perhaps the two most significant theoretical questions about the programming of self-assembling agents are: (1) necessary and sufficient conditions to produce a unique terminal a...
128
Voted
COCO
1994
Springer
15 years 4 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...