2446 search results - page 181 / 490 » Choiceless Polynomial Time |
104
click to vote
SAGT
2009
Springer
15 years 10 months ago
2009
Springer
Let A be a randomized, unlimited supply, unit demand, single-item auction, which given a bid-vector b ∈ [h]n , has expected profit E[P(b)]. Aggarwal et al. showed that given A, ...
147
click to vote
SARA
2009
Springer
15 years 10 months ago
2009
Springer
We present algorithms for testing the satisfiability and finding the tightened transitive closure of conjunctions of addition constraints of the form ±x ± y ≤ d and bound co...
121
click to vote
TAMC
2009
Springer
15 years 10 months ago
2009
Springer
We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and analyze these to obtain a linear kernel for the planar Connected Dominating Set pr...
155
click to vote
TARK
2009
Springer
15 years 10 months ago
2009
Springer
The logical omniscience feature assumes that an epistemic agent knows all logical consequences of her assumptions. This paper offers a general theoretical framework that views log...
121
click to vote
DSD
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper proposes a design method and programmable architectures for numerical function generators (NFGs) of two-variable functions. To realize a two-variable function in hardwa...