7106 search results - page 237 / 1422 » Restricted Complexity, General Complexity |
146
click to vote
DAC
2002
ACM
16 years 5 months ago
2002
ACM
The ability to compute the parasitic inductance of the interconnect is critical to the timing verification of modern VLSI circuits. A challenging aspect of inductance extraction i...
148
click to vote
WWW
2008
ACM
16 years 5 months ago
2008
ACM
Effective access to and navigation in information stored in deep Web ontological repositories or relational databases has yet to be realized due to issues with usability of user i...
132
click to vote
CADE
2006
Springer
16 years 4 months ago
2006
Springer
Context Unification is the problem to decide for a given set of second-order equations E where all second-order variables are unary, whether there exists a unifier, such that for e...
131
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete versi...
123
click to vote
PODS
2001
ACM
16 years 4 months ago
2001
ACM
The paper investigates XML document speci cations with DTDs and integrity constraints, such as keysand foreign keys. We study the consistency problem of checking whether a given s...