6 search results - page 1 / 2 » Lower Bounds on the OBDD Size of Graphs of Some Popular Func... |
SOFSEM
2005
Springer
13 years 10 months ago
2005
Springer
APPROX
2009
Springer
13 years 11 months ago
2009
Springer
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
COCO
1997
Springer
13 years 9 months ago
1997
Springer
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
SIROCCO
2007
13 years 6 months ago
2007
Recently, quite a few papers studied methods for representing network properties by assigning informative labels to the vertices of a network. Consulting the labels given to any t...