5608 search results - page 975 / 1122 » On the Theory of Matchgate Computations |
111
click to vote
ECCC
2006
15 years 1 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
119
click to vote
FAC
2006
15 years 1 months ago
2006
The Verified Software Repository is dedicated to a long-term vision of a future in which all computer systems justify the trust that Society increasingly places in them. This will ...
125
click to vote
IJFCS
2006
15 years 1 months ago
2006
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
128
click to vote
SOFTWARE
2008
15 years 1 months ago
2008
s of titles and abstracts) as irrelevant to our focus. We read the remaining 519 papers in full to establish our final list. The 92 papers we chose were originally published in the...
123
Voted
JPDC
2007
15 years 1 months ago
2007
In this paper, we address the problem of multiple sequence alignment (MSA) for handling very large number of proteins sequences on mesh-based multiprocessor architectures. As the ...