Default: Annals of Mathematics and Artificial Intelligence

ISSN: 1012-2443

Journal Home

Journal Guideline

Annals of Mathematics and Artificial Intelligence Q3 Unclaimed

Springer Netherlands Netherlands
Unfortunately this journal has not been claimed yet. For this reason, some information may be unavailable.

Annals of Mathematics and Artificial Intelligence is a journal indexed in SJR in Applied Mathematics and Artificial Intelligence with an H index of 59. It has a price of 2290 €. It has an SJR impact factor of 0,411 and it has a best quartile of Q3. It is published in English. It has an SJR impact factor of 0,411.

Type: Journal

Type of Copyright:

Languages: English

Open Access Policy: Open Choice

Type of publications:

Publication frecuency: -

Price

2290 €

Inmediate OA

NPD

Embargoed OA

0 €

Non OA

Metrics

Annals of Mathematics and Artificial Intelligence

0,411

SJR Impact factor

59

H Index

84

Total Docs (Last Year)

159

Total Docs (3 years)

3255

Total Refs

222

Total Cites (3 years)

147

Citable Docs (3 years)

1.35

Cites/Doc (2 years)

38.75

Ref/Doc

Comments

No comments ... Be the first to comment!



Best articles by citations

On the structural simplicity of machines and languages

View more

Construction of high-order deceptive functions using low-order Walsh coefficients

View more

Random planar shapes and their statistical recognition

View more

Aspect graphs and their use in object recognition

View more

Locally Determined Logic Programs and Recursive Stable Models

View more

The Difficulty of Reduced Error Pruning of Leveled Branching Programs

View more

A survey of some combinatorial results concerning functional dependencies in database relations

View more

Model-based diagnosis of analog electronic circuits

View more

DYANA: Best-first hierarchical diagnosis based on differential equation models

View more

Solving Hierarchical Constraints over Finite Domains with Local Search

View more

Boolean query optimization and the 0-1 hyperbolic sum problem

View more

Some results on the computational complexity of symmetric connectionist networks

View more
SHOW MORE ARTICLES

A conformal prediction approach to explore functional data

View more

Efficient matching of nonrectangular shapes

View more

The F-logic approach for description languages

View more

A Theory of Frame Transformations for Belief Combination

View more

Tracking primary hyperplane competitors during genetic search

View more

The relative complexity of resolution and cut-free Gentzen systems

View more

A probabilistic matching algorithm for computer vision

View more

A generalized Euclidean algorithm for geometry theorem proving

View more

Satisfiability-Based Algorithms for Boolean Optimization

View more

A set expression based inheritance system

View more

Approximation Algorithms for the Class Cover Problem

View more

Characterization of desirable properties of general database decompositions

View more

FAQS