5608 search results - page 186 / 1122 » On the Theory of Matchgate Computations |
113
Voted
BIRTHDAY
2006
Springer
15 years 5 months ago
2006
Springer
We give necessary and sufficient conditions for the first-order theory of a finitely presented abelian lattice-ordered group to be decidable. We also show that if the number of gen...
103
Voted
BIRTHDAY
2010
Springer
15 years 2 months ago
2010
Springer
Let M = (A, <, P) where (A, <) is a linear ordering and P denotes a finite sequence of monadic predicates on A. We show that if A contains an interval of order type or -, an...
111
click to vote
ICPR
2010
IEEE
15 years 25 days ago
2010
IEEE
In this paper we propose a conductance electrical model to represent weighted undirected graphs that allows us to efficiently compute approximate graph isomorphism in large graph...
118
click to vote
ACL
2012
13 years 4 months ago
2012
This work presents a first step to a general implementation of the Semantic-Script Theory of Humor (SSTH). Of the scarce amount of research in computational humor, no research ha...
111
click to vote
JCSS
2007
15 years 1 months ago
2007
We show that the elementary theory of the structure of the Solovay degrees of computably enumerable reals is undecidable.