Timing analysis of targeted hunter searches | Zendy

John W. Jones | Zendy; David P. Roberts | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Timing analysis of targeted hunter searches

Author(s) -

John W. Jones,

David P. Roberts

Publication year - 1998

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-64657-4

DOI - 10.1007/bfb0054880

Subject(s) - discriminant , computer science , degree (music) , polynomial , linear discriminant analysis , finite field , algebra over a field , mathematics , algorithm , discrete mathematics , artificial intelligence , pure mathematics , mathematical analysis , physics , acoustics

One can determine all primitive number fields of a given degree and discriminant with a finite search of potential defining polynomials. We develop an asymptotic formula for the number of polynomials which need to be inspected which reflects both archimedean and non-archimedean restrictions placed on the coefficients of a defining polynomial.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research