Sciweavers

2233 search results - page 108 / 447
» On the Complexity of Theory Curbing
Sort
View
ECCC
2010
122views more  ECCC 2010»
15 years 4 months ago
Query Complexity Lower Bounds for Reconstruction of Codes
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah
ISSAC
2007
Springer
94views Mathematics» more  ISSAC 2007»
16 years 14 days ago
Faster algorithms for the characteristic polynomial
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
Clément Pernet, Arne Storjohann
SIGECOM
2003
ACM
125views ECommerce» more  SIGECOM 2003»
15 years 11 months ago
Complexity of determining nonemptiness of the core
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
Vincent Conitzer, Tuomas Sandholm
AI
2006
Springer
15 years 6 months ago
Complexity of constructing solutions in the core based on synergies among coalitions
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
Vincent Conitzer, Tuomas Sandholm
CAGD
2006
114views more  CAGD 2006»
15 years 6 months ago
Jet subdivision schemes on the k-regular complex
We introduce a new family of subdivision schemes called jet subdivision schemes. Jet subdivision schemes are a natural generalization of the commonly used subdivision schemes for ...
Yonggang Xue, Thomas P.-Y. Yu, Tom Duchamp