Complexity Lower Bounds from Algorithm Design gan Williams, R Ryan

Cael y testun llawn

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

Cael y testun llawn

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

Cael y testun llawn

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

Cael y testun llawn

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

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

Cael y testun llawn

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

Cael y testun llawn

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

Cael y testun llawn