983 search results - page 92 / 197 » Circuit Complexity and Multiplicative Complexity of Boolean ... |
FOCS
2005
IEEE
14 years 3 months ago
2005
IEEE
Barak et al. formalized the notion of obfuscation, and showed that there exist (contrived) classes of functions that cannot be obfuscated. In contrast, Canetti and Wee showed how ...
EOR
2010
13 years 10 months ago
2010
The scheduling of flow shops with multiple parallel machines per stage, usually referred to as the Hybrid Flow Shop (HFS), is a complex combinatorial problem encountered in many r...
COCO
2010
Springer
14 years 8 days ago
2010
Springer
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
ICAI
2007
13 years 11 months ago
2007
Biomolecular networks dynamically respond to stimuli and implement cellular function. Understanding these dynamic changes is the key challenge for cell biologists. As biomolecular...