5 search results - page 1 / 1 » Breaking the Rectangle Bound Barrier against Formula Size Lo... |
MFCS
2010
Springer
13 years 9 months ago
2010
Springer
Karchmer, Kushilevitz and Nisan formulated the formula size problem as an integer programming problem called the rectangle bound and introduced a technique called the LP bound, whi...
COCO
2005
Springer
14 years 4 months ago
2005
Springer
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
CORR
2012
Springer
12 years 6 months ago
2012
Springer
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
SODA
2012
ACM
12 years 1 months ago
2012
ACM
We study the role that parallelism plays in time complexariants of Winfree’s abstract Tile Assembly Model (aTAM), a model of molecular algorithmic self-assembly. In the “hiera...
ICDE
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...