5100 search results - page 768 / 1020 » The Linear Complexity of a Graph |
279
click to vote
VEE
2012
ACM
14 years 2 months ago
2012
ACM
Applications written in dynamically typed scripting languages are increasingly popular for Web software development. Even on the server side, programmers are using dynamically typ...
169
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
256
click to vote
ICLP
2009
Springer
16 years 7 months ago
2009
Springer
The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true...
185
click to vote
ICALP
2007
Springer
16 years 21 days ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
215
click to vote
ECBS
1999
IEEE
15 years 11 months ago
1999
IEEE
Engineering systems are becoming increasingly complex as state of the art technologies are incorporated into designs. Surety modeling and analysis is an emerging science which per...