650 search results - page 85 / 130 » On Coalgebras over Algebras |
ECCC
2008
13 years 9 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
SIGMOD
2004
ACM
14 years 9 months ago
2004
ACM
We are developing a distributed query processor called PIER, which is designed to run on the scale of the entire Internet. PIER utilizes a Distributed Hash Table (DHT) as its comm...
EDBT
2008
ACM
14 years 9 months ago
2008
ACM
Many systems such as Tukwila and YFilter combine automaton and algebra techniques to process queries over tokenized XML streams. Typically in this architecture, an automaton is fi...
ALT
2002
Springer
14 years 5 months ago
2002
Springer
The central topic of the paper is the learnability of the recursively enumerable subspaces of V∞/V , where V∞ is the standard recursive vector space over the rationals with (c...
COCO
2005
Springer
14 years 2 months ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...