6894 search results - page 121 / 1379 » Generation Problems |
184
click to vote
SAT
2009
Springer
16 years 28 days ago
2009
Springer
Cryptography ensures the confidentiality and authenticity of information but often relies on unproven assumptions. SAT solvers are a powerful tool to test the hardness of certain ...
134
click to vote
WSC
2004
15 years 7 months ago
2004
Computer-based business analysis relies on models, or algorithmic representations of the business process. Real-life business problems can become very complex, which creates diffi...
161
click to vote
ECCC
1998
15 years 6 months ago
1998
Impagliazzo and Wigderson IW97] have recently shown that if there exists a decision problem solvable in time 2O(n) and having circuit complexity 2 (n) (for all but nitely many n) ...
182
click to vote
DSN
2002
IEEE
15 years 11 months ago
2002
IEEE
Traditional problem determination techniques rely on static dependency models that are difficult to generate accurately in today’s large, distributed, and dynamic application e...
165
click to vote
ICALP
1990
Springer
15 years 10 months ago
1990
Springer
Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction ca...