Algorithms, complexity and discreteness criteria in PSL(2, C)

Research output: Contribution to journalArticle

8 Citations (Scopus)
Original languageEnglish (US)
Pages (from-to)91-114
Number of pages24
JournalJournal d'Analyse Mathematique
Volume73
DOIs
StatePublished - Jan 1 1997

Fingerprint

Algorithm Complexity

All Science Journal Classification (ASJC) codes

  • Analysis
  • Mathematics(all)

Cite this

@article{221e228d86004c728f99c63375e7dd3b,
title = "Algorithms, complexity and discreteness criteria in PSL(2, C)",
author = "Jane Gilman",
year = "1997",
month = "1",
day = "1",
doi = "10.1007/BF02788139",
language = "English (US)",
volume = "73",
pages = "91--114",
journal = "Journal d'Analyse Mathematique",
issn = "0021-7670",
publisher = "Springer New York",

}

Algorithms, complexity and discreteness criteria in PSL(2, C). / Gilman, Jane.

In: Journal d'Analyse Mathematique, Vol. 73, 01.01.1997, p. 91-114.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Algorithms, complexity and discreteness criteria in PSL(2, C)

AU - Gilman, Jane

PY - 1997/1/1

Y1 - 1997/1/1

UR - http://www.scopus.com/inward/record.url?scp=0031441212&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031441212&partnerID=8YFLogxK

U2 - 10.1007/BF02788139

DO - 10.1007/BF02788139

M3 - Article

AN - SCOPUS:0031441212

VL - 73

SP - 91

EP - 114

JO - Journal d'Analyse Mathematique

JF - Journal d'Analyse Mathematique

SN - 0021-7670

ER -