3415 search results - page 404 / 683 » Lower bounds on kernelization |
158
click to vote
ACAL
2007
Springer
16 years 25 days ago
2007
Springer
There has been some ambiguity about the growth of attractors in Kauffman networks with network size. Some recent work has linked this to the role and growth of circuits or loops o...
186
click to vote
CAAN
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. Random graphs with given expected degrees G(w) were introduced by Chung and Lu so as to extend the theory of classical G(n, p) random graphs to include random power law g...
143
click to vote
CSL
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. By introducing a parallel extension rule that is aware of independence of the introduced extension variables, a calculus for quantified propositional logic is obtained w...
147
click to vote
ICDT
2007
ACM
16 years 23 days ago
2007
ACM
We introduce a new abstract model of database query processing, finite cursor machines, that incorporates certain data streaming aspects. The model describes quite faithfully what...
177
click to vote
MFCS
2007
Springer
16 years 23 days ago
2007
Springer
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...