1209 search results - page 68 / 242 » Universal Algebra and Computer Science |
RELMICS
2005
Springer
15 years 5 months ago
2005
Springer
In this paper we present some examples of relational correspondences for not necessarily distributive lattices with modal-like operators of possibility (normal and additive operato...
SIGCSE
2005
ACM
15 years 5 months ago
2005
ACM
This paper describes how the Institute for Computing Education (ICE) at Georgia Tech is trying to improve the state of computer science education in secondary schools in Georgia. ...
ITICSE
2000
ACM
15 years 4 months ago
2000
ACM
We are concerned about a view in undergraduate computer science education, especially in the early courses, that it’s okay to be math-phobic and still prepare oneself to become ...
117
click to vote
DIS
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. The Symposium on Computational Discovery of Communicable Knowledge was held from March 24 to 25, 2001, at Stanford University. Fifteen speakers reviewed recent advances i...
STACS
2010
Springer
15 years 3 months ago
2010
Springer
We completely characterise the computational complexity of the list homomorphism problem for graphs in combinatorial and algebraic terms: for every graph H the problem is either N...