Complexity Lower Bounds from Algorithm Design od Williams, R Ryan

Polni tekst

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

Polni tekst

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

Polni tekst

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

Polni tekst

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

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

Polni tekst

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

Polni tekst

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

Polni tekst