Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs

Mark Braverman; Gil Cohen; Sumegha Garg

doi:10.1137/18m1197734

Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs

SIAM Journal on Computing ◽

10.1137/18m1197734 ◽

2020 ◽

Vol 49 (5) ◽

pp. STOC18-242-STOC18-299

Author(s):

Mark Braverman ◽

Gil Cohen ◽

Sumegha Garg

Keyword(s):

Branching Programs ◽

Optimal Error

Download Full-text

Hitting sets with near-optimal error for read-once branching programs

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018 ◽

10.1145/3188745.3188780 ◽

2018 ◽

Cited By ~ 1

Author(s):

Mark Braverman ◽

Gil Cohen ◽

Sumegha Garg

Keyword(s):

Branching Programs ◽

Optimal Error ◽

Hitting Sets

Download Full-text

An indirect collocation method for variable-order fractional wave equations on uniform or graded meshes and its optimal error estimates

International Journal of Computer Mathematics ◽

10.1080/00207160.2021.1895987 ◽

2021 ◽

pp. 1-17

Author(s):

Zhiwei Yang ◽

Xiangcheng Zheng ◽

Hong Wang

Keyword(s):

Collocation Method ◽

Error Estimates ◽

Wave Equations ◽

Optimal Error Estimates ◽

Variable Order ◽

Optimal Error ◽

Graded Meshes ◽

Fractional Wave Equations

Download Full-text

Unknown source identification problem for space-time fractional diffusion equation: optimal error bound analysis and regularization method

Inverse Problems in Science and Engineering ◽

10.1080/17415977.2021.1900841 ◽

2021 ◽

pp. 1-45

Author(s):

Fan Yang ◽

Qian-Chao Wang ◽

Xiao-Xiao Li

Keyword(s):

Diffusion Equation ◽

Source Identification ◽

Regularization Method ◽

Identification Problem ◽

Fractional Diffusion ◽

Optimal Error ◽

Time Fractional Diffusion Equation ◽

Error Bound Analysis ◽

Optimal Error Bound ◽

Bound Analysis

Download Full-text

Noise reduction in high-order IIR filters using optimal error feedback based upon a Chebyshev criterion

Signal Processing ◽

10.1016/s0165-1684(97)00185-0 ◽

1998 ◽

Vol 64 (2) ◽

pp. 177-183 ◽

Cited By ~ 1

Author(s):

A. Djebbari ◽

J.M. Rouvaen ◽

Al. Djebbari ◽

M.F. Belbachir

Keyword(s):

Noise Reduction ◽

High Order ◽

Error Feedback ◽

Optimal Error ◽

Iir Filters

Download Full-text

Optimal Error Estimates of Two Mixed Finite Element Methods for Parabolic Integro-Differential Equations with Nonsmooth Initial Data

Journal of Scientific Computing ◽

10.1007/s10915-012-9666-8 ◽

2013 ◽

Vol 56 (1) ◽

pp. 131-164 ◽

Cited By ~ 9

Author(s):

Deepjyoti Goswami ◽

Amiya K. Pani ◽

Sangita Yadav

Keyword(s):

Finite Element ◽

Initial Data ◽

Differential Equations ◽

Error Estimates ◽

Finite Element Methods ◽

Mixed Finite Element ◽

Mixed Finite Element Methods ◽

Optimal Error Estimates ◽

Optimal Error ◽

Nonsmooth Initial Data

Download Full-text

The SDFEM for a Convection-Diffusion Problem with a Boundary Layer: Optimal Error Analysis and Enhancement of Accuracy

SIAM Journal on Numerical Analysis ◽

10.1137/s0036142902404728 ◽

2003 ◽

Vol 41 (5) ◽

pp. 1620-1642 ◽

Cited By ~ 61

Author(s):

Martin Stynes ◽

Lutz Tobiska

Keyword(s):

Boundary Layer ◽

Error Analysis ◽

Diffusion Problem ◽

Optimal Error ◽

Convection Diffusion

Download Full-text

An Integral Characterization of Optimal Error Covariance by Kalman Filtering

2018 Annual American Control Conference (ACC) ◽

10.23919/acc.2018.8430782 ◽

2018 ◽

Cited By ~ 4

Author(s):

Song Fang ◽

Hideaki Ishii ◽

Jie Chen

Keyword(s):

Kalman Filtering ◽

Optimal Error ◽

Error Covariance

Download Full-text

The Optimal Error of Monte Carlo Integration

Journal of Complexity ◽

10.1006/jcom.1995.1020 ◽

1995 ◽

Vol 11 (4) ◽

pp. 394-415 ◽

Cited By ~ 7

Author(s):

Peter Mathé

Keyword(s):

Monte Carlo ◽

Monte Carlo Integration ◽

Optimal Error

Download Full-text

Bounded-width polynomial-size branching programs recognize exactly those languages in NC1

Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 ◽

10.1145/12130.12131 ◽

1986 ◽

Cited By ~ 87

Author(s):

D A Barrington

Keyword(s):

Branching Programs ◽

Polynomial Size ◽

Bounded Width

Download Full-text

Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016 ◽

10.1145/2897518.2897653 ◽

2016 ◽

Cited By ~ 20

Author(s):

Amir Abboud ◽

Thomas Dueholm Hansen ◽

Virginia Vassilevska Williams ◽

Ryan Williams

Keyword(s):

Lower Bound ◽

Edit Distance ◽

Branching Programs

Download Full-text