2233 search results - page 114 / 447 » On the Complexity of Theory Curbing |
163
click to vote
CSL
2005
Springer
15 years 12 months 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...
166
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...
139
click to vote
LICS
2008
IEEE
16 years 22 days 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...
180
click to vote
AAAI
1997
15 years 7 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...
177
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
In the algebraic theory of codes and formal languages, the set Q of all primitive words over some alphabet Σ has received special interest. With this survey article we give an ove...