Old Web
English
Sign In
Acemap
>
Paper
>
On class of equation sets whose word problems are reducible to those of ground equation sets
On class of equation sets whose word problems are reducible to those of ground equation sets
2012
Sakai Toshimitsu
Sakai Masahiko
Sakabe Toshiki
Nishida Naoki
Kusakari Keiichirou
Keywords:
Combinatorics
Word problem (mathematics education)
Discrete mathematics
Mathematics
congruence closure
Algebra
equational theory
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]