Complexity Lower Bounds from Algorithm Design von Williams, R Ryan

Volltext

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

Volltext

De-linearizing linearity : projective quantum axiomatics from strong compact closure von 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 von Fong, Brendan C, Spivak, David I, Tuyeras, Remy V

Volltext

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

Volltext

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

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

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

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

Volltext

Strongly compact closed semantics von Coecke, B

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

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

Volltext

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

Volltext