BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Czech Republic
1 × Spain
2 × Poland
3 × USA
Collaborated with:
P.Bürgisser A.Torrecillas O.Bournez P.J.d.Naurois J.Marion M.Karpinski P.Koiran T.Lickteig K.Werther
Talks about:
polynomi (3) problem (3) comput (3) real (3) complex (2) complet (2) class (2) time (2) semialgebra (1) arbitrari (1)

Person: Felipe Cucker

DBLP DBLP: Cucker:Felipe

Contributed to:

STOC 20102010
ICALP 20072007
STOC 20042004
FoSSaCS 20032003
ICALP 19991999
STOC 19951995
ICALP 19911991

Wrote 7 papers:

STOC-2010-BurgisserC #equation #polynomial #problem
Solving polynomial equations in smoothed polynomial time and a near solution to smale’s 17th problem (PB, FC), pp. 503–512.
ICALP-2007-BurgisserC #complexity #problem #quantifier
Exotic Quantifiers, Complexity Classes, and Complete Problems (PB, FC), pp. 207–218.
STOC-2004-BurgisserC #algebra #complexity #set
Counting complexity classes for numeric computations II: algebraic and semialgebraic sets (PB, FC), pp. 475–485.
FoSSaCS-2003-BournezCNM #parallel #polynomial
Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time (OB, FC, PJdN, JYM), pp. 185–199.
Real Computations with Fake Numbers (FC), pp. 55–73.
STOC-1995-CuckerKKLW #on the #turing machine
On real Turing machines that toss coins (FC, MK, PK, TL, KW), pp. 335–342.
ICALP-1991-CuckerT #formal method #problem
Two P-Complete Problems in the Theory of the Reals (FC, AT), pp. 556–565.

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.