13306 search results - page 358 / 2662 » Theoretical Computer Science |
134
click to vote
STACS
1999
Springer
15 years 11 months ago
1999
Springer
We demonstrate how to use Lautemann's proof that BPP is in p 2 to exhibit that BPP is in RPPromiseRP. Immediate consequences show that if PromiseRP is easy or if there exist q...
183
click to vote
TCS
2010
15 years 5 months ago
2010
We present some decidability and undecidability results for subsets of the BlenX Language, a process-calculi-based programming language developed for modelling biological processe...
202
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
Well-structured transition systems provide the right foundation to compute a finite basis of the set of predecessors of the upward closure of a state. The dual problem, to compute...
174
click to vote
ACMSE
2005
ACM
16 years 10 days ago
2005
ACM
In this paper, we describe our first year experiences of administering the NSF-supported Research Experiences for Undergraduates program award. Emerging issues in computer network...
205
click to vote
ICMT
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The QVT Relations (QVT-R) transformation language allows the definition of bidirectional model transformations, which are required in cases where a two (or more) models ...