92 search results - page 16 / 19 » Exploiting structure in quantified formulas |
LAWEB
2003
IEEE
14 years 18 days ago
2003
IEEE
Streaming media applications are becoming more popular on the late years, as for example, news transmitted live through the web, music, show, and films. Traditional client/server...
NDJFL
2010
13 years 2 months ago
2010
The question of the origin of polyadic expressivity is explored and the results are brought to bear on Bertrand Russell's 1903 theory of denoting concepts, which is the main o...
ICCAD
2001
IEEE
14 years 4 months ago
2001
IEEE
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...
FCT
2005
Springer
14 years 25 days ago
2005
Springer
We prove optimal lower bounds for multilinear circuits and for monotone circuits with bounded depth. These lower bounds state that, in order to compute certain functions, these cir...
AAAI
2008
13 years 9 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...