Showing 1 - 11 results of 11 for search '"IEEE Symposium on Logic in Computer Science"', query time: 0.17s Refine Results
  1. 1
    Complexity Lower Bounds from Algorithm Design

    Complexity Lower Bounds from Algorithm Design by Williams, R Ryan

    Published 2022
    Get full text
    Article
  2. 2
    Computable PAC Learning of Continuous Features

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

    Published 2022
    Get full text
    Article
  3. 3
    De-linearizing linearity : projective quantum axiomatics from strong compact closure

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

    Published 2007
    “…Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LiCS'04), IEEE Computer Science Press. …”
    Journal article
  4. 4
    Backprop as Functor: A compositional perspective on supervised learning

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

    Published 2020
    Get full text
    Article
  5. 5
    Computable decision making on the reals and other spaces via partiality and nondeterminism

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

    Published 2019
    Get full text
    Article
  6. 6
    Event domains, stable functions and proof-nets

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

    Published 2007
    “…<em>Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science</em>, 431–44, 1999].</p>…”
    Journal article
  7. 7
    Solvability of matrix-exponential equations

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

    Published 2016
    Conference item
  8. 8
    On the succinctness of query rewriting over shallow ontologies

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

    Published 2014
    Get full text
    Conference or Workshop Item
  9. 9
    Strongly compact closed semantics

    Strongly compact closed semantics by Coecke, B

    Published 2006
    “…In: <em>Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science</em> (LiCS'04), IEEE Computer Science Press. …”
    Journal article
  10. 10
    Tree-like queries in OWL 2 QL: succinctness and complexity results

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

    Published 2015
    Get full text
    Article
  11. 11
    An improved lower bound for the complementation of Rabin automata

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

    Published 2010
    Get full text
    Article

Search Tools: