271 search results - page 40 / 55 » A comparison between two logical formalisms for rewriting |
LCC
1994
13 years 12 months ago
1994
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
PR
2006
13 years 7 months ago
2006
Though most approaches to protein comparison are based on their structure, several studies produced evidence of a strict correlation between the surface characteristics of protein...
ACMSE
2000
ACM
14 years 8 days ago
2000
ACM
We present the background and justi cation for a new approachto studying computation and computational complexity. We focus on categories of problems and categories of solutions w...
JLP
2010
13 years 2 months ago
2010
The work presented here investigates the combination of Kleene algebra with the synchrony model of concurrency from Milner's SCCS calculus. The resulting algebraic structure ...
FMCAD
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Probabilistic techniques for verification of finite-state transition systems offer huge memory savings over deterministic techniques. The two leading probabilistic scheme...