1795 search results - page 114 / 359 » On the Complexity of Circuit Satisfiability |
DATE
2003
IEEE
14 years 2 months ago
2003
IEEE
Tool installation and automation of administrative tasks in heterogeneous computer networks becomes of increasing importance with the availability of complex heterogeneous compute...
EH
1999
IEEE
14 years 1 months ago
1999
IEEE
High-level analog circuit design is a complex problem domain in which evolutionary search has recently produced encouraging results. However, little is known about how to best str...
COCO
1998
Springer
14 years 1 months ago
1998
Springer
We show that MAEXP, the exponential time version of the Merlin-Arthur class, does not have polynomial size circuits. This significantly improves the previous known result due to K...
COMPLEX
2009
Springer
14 years 3 months ago
2009
Springer
By introducing and analyzing a renormalization procedure, Song et al. [1] draw the conclusion that many complex networks exhibit self-repeating patterns on all length scales. First...
ICDT
2010
ACM
14 years 1 months ago
2010
ACM
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...