Conference paper
COUNTERFACTUAL CONCEPT BOTTLENECK MODELS
Gabriele Dominici, Pietro Barbiero, et al.
ICLR 2025
Paper
Complexity of Bezout's theorem V: polynomial time
Abstract
We show that there are algorithms which find an approximate zero of a system of polynomial equations and which function in polynomial time on the average. The number of arithmetic operations is cN4s, where N is the input size and c a universal constant. © 1994.
Related
Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University
M.F. Cowlishaw
IBM Systems Journal
Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004