Publication not explained

This publication has not yet been explained in plain language by the author(s). However, you can still read the publication.

If you are one of the authors, claim this publication so you can create a plain language summary to help more people find, understand and use it.

Featured Image

Read the Original

This page is a summary of: Counting and enumerating feasible rotating schedules by means of Gröbner bases, Mathematics and Computers in Simulation, July 2016, Elsevier,
DOI: 10.1016/j.matcom.2014.12.002.
You can read the full text:

Read

Contributors

The following have contributed to this page