Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

92

Voted

ENTCS
2010

116views more ENTCS 2010»

A Categorical Setting for Lower Complexity

15 years 2 months ago

A Categorical Setting for Lower Complexity

Download pages.cpsc.ucalgary.ca

A polarized strong category consists of a cartesian category, X, and a category Y, together with a module M : X

Robin Cockett, Brian F. Redmond

Real-time Traffic

Cartesian Category | ENTCS 2010 | Polarized | Strong Category |

claim paper

Related Content

» NearOptimal Lower Bounds on the MultiParty Communication Complexity of Set Disjointness

» From a static impossibility to an adaptive lower bound the complexity of early deciding se...

» Lower bounds for the complexity of linear functionals in the randomized setting

» A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness

» Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity II A Simple E...

» Finding Lower Bounds for Nondeterministic State Complexity Is Hard

» Querying Complex SpatioTemporal Sequences in Human Motion Databases

» Probabilistic categorization of kitchen objects in table settings with a composite sensor

» Lower Bounds for the Complexity of Learning HalfSpaces with Membership Queries

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2010
Where	ENTCS
Authors	Robin Cockett, Brian F. Redmond

Comments (0)