1916 search results - page 42 / 384 » Reasoning with class algebra |
CADE
2008
Springer
14 years 10 months ago
2008
Springer
Relation algebras provide abstract equational axioms for the calculus of binary relations. They name an established area of mathematics with various applications in computer scienc...
PLILP
1998
Springer
14 years 2 months ago
1998
Springer
: The bene ts of the object, logic or relational, functional, and constraint paradigms can be obtained from our previous combination of the object and functional paradigms in hidde...
ICCS
2007
Springer
14 years 4 months ago
2007
Springer
In this work we study the computational complexity of a class of grid Monte Carlo algorithms for integral equations. The idea of the algorithms consists in an approximation of the ...
CIE
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
FUIN
2006
13 years 10 months ago
2006
Recently, using a limit schema, we presented an analog and machine independent algebraic characterization of elementary functions over the real numbers in the sense of recursive a...