2479 search results - page 161 / 496 » Quantum complexity theory |
152
click to vote
SMI
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper, we introduce localized homology, a theory for finding local geometric descriptions for topological attributes. Given a space and a cover of subspaces, we construct...
186
click to vote
ATAL
2003
Springer
16 years 1 days ago
2003
Springer
A team of agents planning to perform a complex task make a number of interrelated decisions as they determine precisely how that complex task will be performed. The decision set i...
175
Voted
CSL
2005
Springer
16 years 10 days ago
2005
Springer
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
153
click to vote
LICS
2008
IEEE
16 years 1 months ago
2008
IEEE
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
200
click to vote
AAAI
1997
15 years 8 months ago
1997
Teamwork in complex, dynamic, multi-agent domains mandates highly flexible coordination and communication. Simply fitting individual agents with precomputed coordination plans w...