1920 search results - page 149 / 384 » The Complexity of the A B C Problem |
140
click to vote
ACSC
2004
IEEE
15 years 10 months ago
2004
IEEE
Matrix multiplication is a basic computing operation. Whereas it is basic, it is also very expensive with a straight forward technique of O(N3 ) runtime complexity. More complex s...
150
click to vote
ICLP
1999
Springer
15 years 10 months ago
1999
Springer
In this paper, we focus on the problem of existence of and computing small and large stable models. We show that for every xed integer k, there is a linear-time algorithm to decid...
160
click to vote
IEEESCC
2009
IEEE
16 years 1 months ago
2009
IEEE
In many applications involving composite Web services, one or more component services may become unavailable. This presents us with the problem of identifying other components tha...
160
click to vote
APWEB
2007
Springer
16 years 22 days ago
2007
Springer
How can a RFID (Radio Frequency Identification Devices) system prove that two or more RFID tags are in the same location? Previous researchers have proposed yoking-proof and groupi...
154
click to vote
WAOA
2007
Springer
16 years 19 days ago
2007
Springer
In a buyer-supplier game, a special type of assignment game, a distinguished player, called the buyer, wishes to purchase some combinatorial structure. A set of players, called sup...