3415 search results - page 17 / 683 » Lower Bounds for Kernelizations |
COCO
2004
Springer
14 years 4 months ago
2004
Springer
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
ISCAS
1999
IEEE
14 years 3 months ago
1999
IEEE
In this paper, we obtain the lower bounds on total energy dissipation of deep submicron (DSM) VLSI circuits via an informationtheoretic framework. This framework enables the deriv...
IACR
2011
12 years 10 months ago
2011
Abstract. In this paper we find a lower bound of the second-order nonlinearities of Boolean bent functions of the form f(x) = Trn 1 (α1xd1 + α2xd2 ), where d1 and d2 are Niho ex...
APPROX
2007
Springer
14 years 2 months ago
2007
Springer
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
FLAIRS
2008
13 years 12 months ago
2008
Unit propagation-based (UP) lower bounds are used in the vast majority of current Max-SAT solvers. However, lower bounds based on UP have seldom been applied in PseudoBoolean Opti...