13306 search results - page 361 / 2662 » Theoretical Computer Science |
172
click to vote
FOCS
2003
IEEE
16 years 2 days ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
202
click to vote
HOA
1993
15 years 11 months ago
1993
Theory interpretation is a logical technique for relating one axiomatic theory to another with important applications in mathematics and computer science as well as in logic itself...
198
click to vote
TLCA
2001
Springer
15 years 11 months ago
2001
Springer
We introduce λµ→∧∨⊥ , an extension of Parigot’s λµ-calculus where disjunction is taken as a primitive. The associated reduction relation, which includes the permutati...
146
Voted
ITICSE
1997
ACM
15 years 11 months ago
1997
ACM
A programming exercise on recursion in which students create drawings of simple and bracketed Lindenmayer Systems provides a context for exploring additional computer science conc...
177
click to vote
ITICSE
1996
ACM
15 years 11 months ago
1996
ACM
This paper describes two ways we have integrated algorithm animations into several computer science courses. First, we use previously existing animations during lectures to aid in...