5608 search results - page 168 / 1122 » On the Theory of Matchgate Computations |
117
click to vote
FUIN
2002
15 years 1 months ago
2002
This paper presents a new model of computation that differs from prior models in that it emphasizes data over flow control, has no named variables and has an object-oriented flavo...
100
Voted
CIE
2005
Springer
15 years 7 months ago
2005
Springer
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Potts and Edalat [1]. We choose the constructive type theory as our formal verification t...
133
click to vote
MFCS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
SIP
2001
15 years 3 months ago
2001
The paper presents basic concepts of the discrete system theory from the viewpoint of Banach algebras and shows that some Banach algebras of sequences are not only suitable mathem...
124
click to vote
JUCS
2008
15 years 1 months ago
2008
: Reasoning about incomplete qualitative temporal information is an essential topic in many artificial intelligence and natural language processing applications. In the domain of n...