2373 search results - page 206 / 475 » On the Theory of Structural Subtyping |
165
click to vote
IFIP
2004
Springer
16 years 2 days 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...
195
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
194
click to vote
AGP
1999
IEEE
15 years 11 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
257
click to vote
SEAAI
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. In the past, some information technologies (IT) have quickly been adopted by the engineering practice while the implementation of others has been slower. In the paper, th...
210
click to vote
SIGSOFT
1996
ACM
15 years 10 months ago
1996
ACM
Abstract -- Software architectures enable large-scale software development. Component reuse and substitutability, two key aspects of large-scale development, must be planned for du...