Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems (Lecture Notes in Computer Science, 1001, Band 1001)
53.49 EUR
Teilen: ![]()
![]()
![]()
![]()
![]()
![]()
Gesponsert
Medimops DE
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems (Lecture Notes in Computer Science, 1001, Band 1001)
Medimops DE
07-06-2026 23:54:56
Gesponsert
SpringerLink DE
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems
SpringerLink DE
07-06-2026 19:23:52
