Checking Approximate Computations of Polynomials and Functional Equations (2000)
S Ravi, Kumar Ronitt Rubinfeld
A majority of the results on self-testing and correcting deal with programs which purport to compute the correct results precisely. In this paper, we observe that this notion of correctness is too...
On Learning Bounded-Width Branching Programs (1999)
Funda Erg, S Ravi, Kumar Ronitt Rubinfeld
In this paper, we study PAC-learning algorithms for specialized classes of deterministic finite automata (DFA). In particular, we study branchingprograms, and we investigate the influence of the...
Approximate Checking of Polynomials and Functional Equations (1999)
Funda Ergun, S Ravi, Kumar Ronitt Rubinfeld
In this paper, we show how to check programs that compute polynomials and functions defined by addition theorems --- in the realistic setting where the output of the program is approximate instead of...
Approximate Checking of Polynomials and Functional Equations (1998)
Funda Ergun, S Ravi, Kumar Ronitt Rubinfeld
In this paper, we show how to check programs that compute polynomials and functions defined by addition theorems --- in the realistic setting where the output of the program is approximate instead of...
Approximate Checking of Polynomials and Functional Equations (1998)
Funda Ergun, S Ravi, Kumar Ronitt Rubinfeld
In this paper, we show how to check programs that compute polynomials and functions defined by addition theorems --- in the realistic setting where the output of the program is approximate instead of...
Approximate Checking of Polynomials and Functional Equations (1998)
Funda Ergun, S Ravi, Kumar Ronitt Rubinfeld
In this paper, we show how to check programs that compute polynomials and functions defined by addition theorems --- in the realistic setting where the output of the program is approximate instead of...
On Learning Bounded-Width Branching Programs (1997)
Funda Erg, S Ravi, Kumar Ronitt Rubinfeld
In this paper, we study PAC-learning algorithms for specialized classes of deterministic finite automata (DFA). In particular, we study branchingprograms, and we investigate the influence of the...