Research

Complexity of computations with Pfaffian and Noetherian functions


Reference:

Vorobjov, N. and Gabrielov, A., 2004. Complexity of computations with Pfaffian and Noetherian functions. Springer, p. 211. (NATO Science Series II)

Related documents:

This repository does not currently have the full-text of this item.
You may be able to access a copy if URLs are provided below.

Details

Item Type Conference or Workshop Items (UNSPECIFIED)
CreatorsVorobjov, N.and Gabrielov, A.
EditorsIlyashenko, Y.and Rousseau, C.
DepartmentsFaculty of Science > Computer Science
StatusPublished
ID Code5459

Export

Actions (login required)

View Item