13306 search results - page 377 / 2662 » Theoretical Computer Science |
169
click to vote
TCS
2010
15 years 1 months ago
2010
In this paper we show that the problem of finding a chordless path between a vertex s and a vertex t containing a vertex v remains NP-complete in bipartite graphs, thereby strengt...
177
click to vote
TCS
2010
15 years 1 months ago
2010
We describe a solution to the SAT problem via non-confluent P systems with active membranes, without using membrane division rules. Furthermore, we provide an algorithm for simula...
220
Voted
RTA
2011
Springer
14 years 9 months ago
2011
Springer
Given an equational system, completion procedures compute an equivalent and complete (terminating and confluent) term rewrite system. We present a very simple and efficient compl...
144
click to vote
CCA
2009
Springer
16 years 1 months ago
2009
Springer
d Abstract) Robert Rettinger1 Department of Mathematics and Computer Science University of Hagen, Germany Abstract. We show that under reasonable assumptions there exist Riemann ma...
145
click to vote
ITICSE
2006
ACM
16 years 23 days ago
2006
ACM
This empirical study demonstrates that students’ learning of computer science takes place in qualitatively different ways. The results consist of categories, where each category...