Infinite sets that admit fast exhaustive search

Martin Escardo

doi:10.1109/LICS.2007.25

Infinite sets that admit fast exhaustive search

Martin Escardo

Computer Science

Research output: Contribution to conference (unpublished) › Paper

20 Citations (Scopus)

Original language	English
Pages	443-452
Number of pages	10
DOIs	https://doi.org/10.1109/LICS.2007.25
Publication status	Published - 10 Jul 2007
Event	22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), University of Wroclaw, Poland, 10-14 July 2007 - Duration: 10 Jul 2007 → …

Conference

Conference	22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), University of Wroclaw, Poland, 10-14 July 2007
Period	10/07/07 → …

Access to Document

10.1109/LICS.2007.25

http://ieeexplore.ieee.org/iel5/4276538/4276539/04276587.pdf?tp=&isnumber=4276539&arnumber=4276587

Cite this

@conference{07fcd10b2ff548ca89df85c7c3f96eb6,

title = "Infinite sets that admit fast exhaustive search",

author = "Martin Escardo",

year = "2007",

month = jul,

day = "10",

doi = "10.1109/LICS.2007.25",

language = "English",

pages = "443--452",

note = "22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), University of Wroclaw, Poland, 10-14 July 2007 ; Conference date: 10-07-2007",

}