Sciweavers

5608 search results - page 11 / 1122
» On the Theory of Matchgate Computations
Sort
View
TCS
2010
14 years 10 months ago
Comparing free algebras in Topological and Classical Domain Theory
We compare how computational effects are modelled in Classical Domain Theory and Topological Domain Theory. Both of these theories provide powerful toolkits for denotational sema...
Ingo Battenfeld
SIAMCOMP
2000
106views more  SIAMCOMP 2000»
14 years 11 months ago
Computationally Sound Proofs
This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation at large. Computationally sound proofs provide, in a...
Silvio Micali
MOC
1998
104views more  MOC 1998»
14 years 11 months ago
Chaos in the Lorenz equations: A computer assisted proof. Part II: Details
Abstract. Details of a new technique for obtaining rigorous results concerning the global dynamics of nonlinear systems is described. The technique abstract existence results based...
Konstantin Mischaikow, Marian Mrozek
JUCS
2010
133views more  JUCS 2010»
14 years 6 months ago
From Computing Sets of Optima, Pareto Sets, and Sets of Nash Equilibria to General Decision-Related Set Computations
: Several algorithms have been proposed to compute sets of optima, Pareto sets, and sets of Nash equilibria. In this paper, we present a general algorithm for decision-related set ...
Vladik Kreinovich, Bartlomiej Jacek Kubica
LLC
2011
123views more  LLC 2011»
14 years 6 months ago
Computational Phonology - Part I: Foundations
Computational phonology approaches the study of sound patterns in the world’s languages from a computational perspective. This article explains this perspective and its relevanc...
Jeffrey Heinz