Showing 1 - 14 results of 14 for search 'Hemachandra, Lane A.', query time: 0.05s Refine Results
In addition to media from the THWS, media from other Bavarian libraries are also displayed.
These are marked with the "Interlibrary loan" label and can be ordered by clicking on them.
  1. 1
    On the complexity of graph reconstruction

    On the complexity of graph reconstruction by Kratsch, Dieter 1959-, Hemachandra, Lane A.

    Published 1991
    Book Interlibrary loan Place Request


    Saved in:
  2. 2
    A complexity theory for feasible closure properties

    A complexity theory for feasible closure properties by Ogiwara, Mitsunori, Hemachandra, Lane A.

    Published 1991
    Book Interlibrary loan Place Request


    Saved in:
  3. 3
    Banishing robust turing completeness

    Banishing robust turing completeness by Hemachandra, Lane A., Jain, Sanjay, Vereščagin, Nikolaj K. 1958-

    Published 1991
    Book Interlibrary loan Place Request


    Saved in:
  4. 4
    Using inductive counting to simulate nondeterministic computation

    Using inductive counting to simulate nondeterministic computation by Buntrock, Gerhard, Hemachandra, Lane A., Siefkes, Dirk 1938-2016

    Published 1990
    Book Interlibrary loan Place Request


    Saved in:
  5. 5
    On the structure and complexity of infinite sets with minimal perfect hash functions

    On the structure and complexity of infinite sets with minimal perfect hash functions by Goldsmith, Judy, Hemachandra, Lane A., Kunen, Kenneth

    Published 1990
    Book Interlibrary loan Place Request


    Saved in:
  6. 6
    On sets with efficient implicit membership tests

    On sets with efficient implicit membership tests by Hemachandra, Lane A., Hoene, Albrecht

    Published 1989
    Book Interlibrary loan Place Request


    Saved in:
  7. 7
    Using randomness to characterize the complexity of computation

    Using randomness to characterize the complexity of computation by Hemachandra, Lane A., Wechsung, Gerd 1939-

    Published 1989
    Book Interlibrary loan Place Request


    Saved in:
  8. 8
    Algorithms from complexity theory polynomial-time operations for complex sets

    Algorithms from complexity theory polynomial-time operations for complex sets by Hemachandra, Lane A.

    Published 1990
    Book Interlibrary loan Place Request


    Saved in:
  9. 9
    Collapsing degrees via strong computation

    Collapsing degrees via strong computation by Hemachandra, Lane A., Hoene, Albrecht

    Published 1990
    Book Interlibrary loan Place Request


    Saved in:
  10. 10
    On relativization and the existence of turing complete sets

    On relativization and the existence of turing complete sets by Hemachandra, Lane A., Jain, Sanjay

    Published 1989
    Book Interlibrary loan Place Request


    Saved in:
  11. 11
    On checking versus evaluation of multiple queries characteristic vector terseness

    On checking versus evaluation of multiple queries characteristic vector terseness by Hemachandra, Lane A., Hoene, Albrecht

    Published 1988
    Book Interlibrary loan Place Request


    Saved in:
  12. 12
    Unambiguous computation may be better than determinism at simulating nondeterminism

    Unambiguous computation may be better than determinism at simulating nondeterminism by Buntrock, Gerhard, Hemachandra, Lane A., Siefkes, Dirk 1938-2016

    Published 1988
    Book Interlibrary loan Place Request


    Saved in:
  13. 13
    Counting in structural complexity theory

    Counting in structural complexity theory by Hemachandra, Lane A.

    Published 1987
    Book Interlibrary loan Place Request


    Saved in:
  14. 14
    Exact counting is as easy as approximate counting

    Exact counting is as easy as approximate counting by Cai, Jin-Yi, Hemachandra, Lane A.

    Published 1986
    Book Interlibrary loan Place Request


    Saved in:

Search Tools: