scientific article; zbMATH DE number 1929948

MaRDI QIDQ4708580zbMATH OpenFDO

Authors Juhani Karhumäki, Mika Hirvensalo

Publication date 18 June 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2420/24200319.htm

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Computing partial information out of intractable: powers of algebraic numbers as an example
• THE BENFORD-NEWCOMB DISTRIBUTION AND UNAMBIGUOUS CONTEXT-FREE LANGUAGES
• Efficient implementation of algorithms for approximate exponentiation
• Integer complexity: experimental and analytical results. II
• The cost of computing integers

Cited in

(3)

• Computing partial information out of intractable: powers of algebraic numbers as an example
• Efficient implementation of algorithms for approximate exponentiation
• Weak minimization of DFA -- an algorithm and applications

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4708580)