16666 search results - page 365 / 3334 » Descriptive and Computational Complexity |
170
click to vote
IANDC
2010
15 years 5 months ago
2010
Simulation preorder/equivalence and bisimulation equivalence are the most commonly used equivalences in concurrency theory. Their standard definitions are often called strong sim...
203
click to vote
CSFW
2011
IEEE
14 years 6 months ago
2011
IEEE
—In this paper, we investigate the computational complexity of quantitative information flow (QIF) problems. Information-theoretic quantitative relaxations of noninterference (b...
186
click to vote
RTA
2009
Springer
16 years 1 months ago
2009
Springer
We study the derivational complexity induced by the (basic) dependency pair method. Suppose the derivational complexity induced by a termination method is closed under elementary f...
177
click to vote
FDG
2009
ACM
16 years 1 months ago
2009
ACM
This work provides detailed measurements of the motion and scene complexity for a wide variety of video games. Novel algorithms to measure motion and scene complexity are presente...
163
click to vote
FSTTCS
2004
Springer
16 years 5 days ago
2004
Springer
Abstract. Given two simplicial complexes C1 and C2 embedded in Euclidean space IRd , C1 subdivides C2 if (i) C1 and C2 have the same underlying space, and (ii) every simplex in C1 ...