Self-correcting polynomial programs
type: Item
instance of: scholarly article
title: Self-correcting polynomial programs
zbMATH Open document ID: 0849.68013
DOI: 10.1007/BF02425916
author: Guevara Noubir
author: Henri J. Nussbaumer
published in: Reliable Computing
publication date: 1996-11-04T00:00:00Z
Mathematics Subject Classification ID: 68N99
zbMATH DE Number: 902719
zbMATH Keywords: random self-reducibility
MaRDI profile type: Publication
cites work: Fast Fourier transform and convolution algorithms
cites work: Efficient checking of polynomials and proofs and the hardness of approximation problems
Recommended article: Self-correcting schemes for functions of polynomial weight
Recommended article: Highly resilient correctors for polynomials
Recommended article: Computing polynomial program invariants
Recommended article: Q5395800
Recommended article: Verification, Model Checking, and Abstract Interpretation
Recommended article: Q4763385
Recommended article: Program correctness on finite fields
Recommended article: Polynomial runtime and composability
Recommended article: Perspectives of System Informatics
Recommended article: Self-correcting constructions of finite automata
description: scientific article; zbMATH DE number 902719