Complexity Lower Bounds from Algorithm Design by Williams, R Ryan

Get full text

Computable PAC Learning of Continuous Features by Ackerman, Nathanael, Asilis, Julian, Di, Jieqi, Freer, Cameron, Tristan, Jean-Baptiste

Get full text

De-linearizing linearity : projective quantum axiomatics from strong compact closure by Coecke, B

“…Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LiCS'04), IEEE Computer Science Press. …”

Backprop as Functor: A compositional perspective on supervised learning by Fong, Brendan C, Spivak, David I, Tuyeras, Remy V

Get full text

Computable decision making on the reals and other spaces via partiality and nondeterminism by Sherman, Benjamin, Sciarappa, Luke, Chlipala, Adam, Carbin, Michael James

Get full text

Event domains, stable functions and proof-nets by Abramsky, S

“…<em>Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science</em>, 431–44, 1999].</p>…”

On the succinctness of query rewriting over shallow ontologies by Kikot, Stanislav, Kontchakov, Roman, Podolskii, Vladimir, Zakharyaschev, Michael

Get full text

Solvability of matrix-exponential equations by Ouaknine, J, Pouly, A, Sousa Pinto, J, Worrell, J

Tree-like queries in OWL 2 QL: succinctness and complexity results by Bienvenu, Meghyn, Kikot, Stanislav, Podolskii, Vladimir

Get full text

Strongly compact closed semantics by Coecke, B

“…In: <em>Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science</em> (LiCS'04), IEEE Computer Science Press. …”

An improved lower bound for the complementation of Rabin automata by Cai, Yang, Zhang, Ting, Luo, Haifeng

Get full text