2446 search results - page 20 / 490 » Choiceless Polynomial Time |
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We show that minimal k-vertex connected spanning subgraphs of a given graph can be generated in incremental polynomial time for any fixed k.
COCOON
2005
Springer
14 years 1 months ago
2005
Springer
We study the edge-connectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)-approximation algorithm for ...
CSL
2003
Springer
14 years 22 days ago
2003
Springer
Abstract. Abduction is a fundamental mode of reasoning, which has taken on increasing importance in Artificial Intelligence (AI) and related disciplines. Computing abductive expla...
ENTCS
2008
13 years 7 months ago
2008
Abstract
STACS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We introduce a new class VPSPACE of families of polynomials. Roughly speaking, a family of polynomials is in VPSPACE if its coefficients can be computed in polynomial spa...