89 search results - page 12 / 18 » Upper Bounds on the Number of Solutions of Binary Integer Pr... |
FSTTCS
2009
Springer
14 years 1 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
ICALP
2011
Springer
12 years 10 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
APPROX
2009
Springer
14 years 2 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...
TAMC
2007
Springer
14 years 1 months ago
2007
Springer
In previous work we have introduced an average-case measure for the time complexity of Boolean circuits – that is the delay between feeding the input bits into a circuit and the ...
NAACL
2007
13 years 8 months ago
2007
The task of selecting and ordering information appears in multiple contexts in text generation and summarization. For instance, methods for title generation construct a headline b...