Complexity Lower Bounds from Algorithm Design door Williams, R Ryan

Volledige tekst

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

Volledige tekst

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

Volledige tekst

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

Volledige tekst

Event domains, stable functions and proof-nets door 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 door Ouaknine, J, Pouly, A, Sousa Pinto, J, Worrell, J

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

Volledige tekst

Strongly compact closed semantics door 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 door Bienvenu, Meghyn, Kikot, Stanislav, Podolskii, Vladimir

Volledige tekst

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

Volledige tekst