BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Japan
1 × Portugal
1 × Switzerland
2 × USA
Collaborated with:
H.Fournier V.Nesme N.Portier N.Kayal T.Pecatte C.Saha F.Cucker M.Karpinski T.Lickteig K.Werther
Talks about:
lower (4) bound (4) real (3) easier (2) univari (1) quantum (1) problem (1) complex (1) machin (1) simon (1)

Person: Pascal Koiran

DBLP DBLP: Koiran:Pascal

Contributed to:

ICALP (1) 20152015
ICALP 20052005
ICALP 20002000
STOC 19981998
STOC 19951995

Wrote 5 papers:

ICALP-v1-2015-KayalKPS #bound
Lower Bounds for Sums of Powers of Low Degree Univariates (NK, PK, TP, CS), pp. 810–821.
ICALP-2005-KoiranNP #bound #complexity #problem #quantum #query
A Quantum Lower Bound for the Query Complexity of Simon’s Problem (PK, VN, NP), pp. 1287–1298.
ICALP-2000-FournierK #bound
Lower Bounds Are Not Easier over the Reals: Inside PH (HF, PK), pp. 832–843.
STOC-1998-FournierK #bound #question
Are Lower Bounds Easier over the Reals? (HF, PK), pp. 507–513.
STOC-1995-CuckerKKLW #on the #turing machine
On real Turing machines that toss coins (FC, MK, PK, TL, KW), pp. 335–342.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.