1686 search results - page 116 / 338 » Programs as polygraphs: computability and complexity |
118
click to vote
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
111
click to vote
BIRTHDAY
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. This paper investigates how to apply the techniques on solving semi-algebraic systems to invariant generation of polynomial programs. By our approach, the generated invar...
107
Voted
ACMSE
2005
ACM
15 years 9 months ago
2005
ACM
As component-oriented approaches become increasingly pervasive in the development of complex software systems, it becomes increasingly important to introduce computing science stu...
144
Voted
POPL
2010
ACM
16 years 26 days ago
2010
ACM
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
139
click to vote
SAC
2003
ACM
15 years 8 months ago
2003
ACM
Networked embedded systems such as wireless sensor networks are usually designed to be event-driven so that they are reactive and power efficient. Programming embedded systems wit...