1717 search results - page 130 / 344 » A Computable Spectral Theorem |
122
click to vote
IPPS
1997
IEEE
15 years 8 months ago
1997
IEEE
Naive parallel implementation of nondeterministic systems (such as a theorem proving system) and languages (such as a logic, constraint, or a concurrent constraint language)can re...
108
click to vote
MST
2008
15 years 4 months ago
2008
The Turing and many-one completeness notions for NP have been previously separated under measure, genericity, and bi-immunity hypotheses on NP. The proofs of all these results rel...
148
click to vote
DAGSTUHL
2008
15 years 6 months ago
2008
The construction of computational cognitive models integrating the connectionist and symbolic paradigms of artificial intelligence is a standing research issue in the field. The co...
131
click to vote
ASIAN
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper is concerned about relating formal and computational models of cryptography in case of active adversaries when formal security analysis is done with first ord...
149
click to vote
AISC
2008
Springer
15 years 6 months ago
2008
Springer
Graph-based formalisms of quantum computation provide an abstract and symbolic way to represent and simulate computations. However, manual manipulation of such graphs is slow and e...