9842 search results - page 1365 / 1969 » The Complexity of the Matching-Cut Problem |
206
click to vote
PODS
2006
ACM
16 years 7 months ago
2006
ACM
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
222
click to vote
PODS
2007
ACM
16 years 7 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
179
click to vote
CEC
2009
IEEE
16 years 2 months ago
2009
IEEE
— Many researchers have encountered the problem that the evolution of electronic circuits becomes exponentially more difficult when problems with an increasing number of outputs...
187
click to vote
CPAIOR
2009
Springer
16 years 1 months ago
2009
Springer
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdi...
175
click to vote
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...