2446 search results - page 164 / 490 » Choiceless Polynomial Time |
146
click to vote
ASP
2003
Springer
15 years 9 months ago
2003
Springer
Default logic is used to describe regular behavior and normal properties. We suggest to exploit the framework of default logic for detecting outliers - individuals who behave in a...
135
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We consider the problem of sampling almost uniformly from the set of contingency tables with given row and column sums, when the number of rows is a constant. Cryan and Dyer [3] h...
130
click to vote
COCO
2001
Springer
15 years 9 months ago
2001
Springer
This paper explores the difference between parallel and serial queries to an NP-complete oracle, SAT, from the perspective of functions with a limited number of output bits. For ...
140
click to vote
CSL
2010
Springer
15 years 5 months ago
2010
Springer
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
111
click to vote
CDC
2008
IEEE
15 years 11 months ago
2008
IEEE
—We consider distributed iterative algorithms for the averaging problem over time-varying topologies. Our focus is on the convergence time of such algorithms when complete (unqua...