Richardson's theorem

In mathematics, Richardson's theorem establishes a limit on the extent to which an algorithm can decide whether certain mathematical expressions are… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1978-2017
02419782017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Let D = (V (D), A(D)) be a digraph, DP(D) be the set of directed paths of D and let Π be a subset of DP(D). A subset S ⊆ V (D… (More)
Is this relevant?
2012
2012
characterisation of transition relations determined by local rule of CA Richardson, D.: Tassellations with local transformations. 
Is this relevant?
2012
2012
This study presents an EFL (English as a Foreign Language) instructional model in which peer interaction improves motivation… (More)
Is this relevant?
2010
2010
Given a set 5 with an irreflexive relation >, define the operators dom and max as follows. For any subset T of S, dom T is the… (More)
Is this relevant?
2007
2007
Due to the difficulty of defining a complete domain definition, it is hard to apply planners to real-life application domains… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2004
2004
The genus Rattus is a very common group of rodents with a great number of species mainly distributed in Asia. Only R. rattus and… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
2003
2003
We investigated the influence of happy and angry expressions on memory for new faces. Participants were presented with happy and… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
The classification methods for feature spectra are based on a comparison of the spectral image with a reference spectrum… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • figure 1
Is this relevant?
1998
1998
Lagrangian calculations of average concentrations require knowledge of one-particle statistics. However, if Lagrangian… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1987
1987
For general concepts we refer the reader to [1]. Le t G = (X, U) be a finite digraph where X denotes the set of vertices and U is… (More)
  • figure 1
Is this relevant?