514 search results - page 30 / 103 » On the Structure of Valiant's Complexity Classes |
EACL
2009
ACL Anthology
14 years 9 months ago
2009
ACL Anthology
We present novel parsing algorithms for several sets of mildly non-projective dependency structures. First, we define a parser for well-nested structures of gap degree at most 1, ...
IFIP
2004
Springer
14 years 2 months ago
2004
Springer
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
AOSD
2010
ACM
14 years 3 months ago
2010
ACM
The development of complex software requires the implementation of functions over a variety of recursively defined data structures. The design (and modeling) of structures can it...
FM
2009
Springer
14 years 3 months ago
2009
Springer
Statecharts and Petri nets are two popular visual formalisms for modelling complex systems that exhibit concurrency. Both formalisms are supported by various design tools. To enabl...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical co...