yusuke1997/dblp-id-title huggingface dataset:
Efficient algorithms for the longest common subsequence problem with sequential substring constraints
Simple algorithms for approximating all roots of a polynomial with real roots
Condition-Sensitive Computation of Approximate Fixed Points
Approximation of infinitely differentiable multivariate functions is not strongly tractable
Condition Number Bounds for Problems with Integer Coefficients
Multilevel Picard approximations overcome the curse of dimensionality in the numerical approximation of general semilinear PDEs with gradient-dependent nonlinearities
Average-case complexity without the black swans
Stochastic Analog Networks and Computational Complexity
Takashi Goda and Larisa Yaroslavtseva share the 2017 Joseph F. Traub Information-Based Complexity Young Researcher Award
Approximation and Geometry in High Dimensions
GUEST EDITORS' PREFACE
On the complexity of solving quadratic Boolean systems
Kateryna Pozharska is the winner of the 2023 Joseph F. Traub Information-Based Complexity Young Researcher Award
On the counting function of the lattice profile of periodic sequences
Critical points and values of complex polynomials
Different Quality Indexes for Lattice Rules
Aicke Hinrichs, Simon Foucart, Alain Pajor, Holger Rauhut, Tino Ullrich win the 2010 Best Paper Award
A note on a modification of Moser's method
Multi-kernel regularized classifiers
Tractability results for integration in subspaces of the Wiener algebra
Pricing Algorithms of Multivariate Path Dependent Options
On the effectiveness of a generalization of Miller's primality theorem
Quasi-Monte Carlo methods for integration of functions with dominating mixed smoothness in arbitrary dimension
Weak Bézout inequality for D-modules
Complexity of Weighted Approximation over R d
On the complexity of online computations of real functions
Representing probability measures using probabilistic processes
Quantum complexity of parametric integration
The nonzero gain coefficients of Sobol's sequences are always powers of two
ABC on IBC
Inexact Newton-type methods
A note on two fixed point problems
Computing zeta functions of Artin-Schreier curves over finite fields II
A note on a P NP result for a restricted class of real machines
Optimal Monte Carlo integration with fixed relative precision
The descriptive complexity of stochastic integration
Noisy polynomial interpolation modulo prime powers
Corrigendum to "On the expressiveness and decidability of o-minimal hybrid systems" [J. Complexity 21 (2005) 447-478]
Finding Well-Conditioned Similarities to Block-Diagonalize Nonsymmetric Matrices Is NP-Hard
The Diamond ensemble: A constructive set of spherical points with small logarithmic energy
Complexity bounds for second-order optimality in unconstrained optimization
NP-hardness of multiple bondage in graphs
On the mean square weighted L 2 discrepancy of randomized digital nets in prime base
New averaging technique for approximating weighted integrals
A regularized solution to edge detection
A Milstein-based free knot spline approximation for stochastic differential equations
On the worst-case arithmetic complexity of approximating zeros of polynomials
Optimal subsampling for least absolute relative error estimators with massive data
Computation of Edit Probabilities and Edit Distances for the A5-Type Keystream Generator
FROM THE EDITOR
A semilocal convergence result for Newton's method under generalized conditions of Kantorovich
Complexity of initial-value problems for ordinary differential equations of order k
Worst Case Complexity of Weighted Approximation and Integration over R d
Why a journal of complexity?
On the L 2 -Discrepancy of the Sobol-Hammersley Net in Dimension 3
Widths of Besov classes of generalized smoothness on the sphere
Conditionally optimal algorithms and estimation of reduced order models
Global optimality of 3- and 5-point Fibonacci lattices for quasi-Monte Carlo integration and general energies
The algorithm designer versus nature: A game-theoretic approach to information-based complexity
On the Complexity of Sparse Elimination
Geo-indistinguishable location obfuscation with inference error bounds
A One-Dimensional Optimization Algorithm and Its Convergence Rate under the Wiener Measure
Improved bounds for the bracketing number of orthants or revisiting an algorithm of Thiémard to compute bounds for the star discrepancy
A non-uniform discretization of stochastic heat equations with multiplicative noise on the unit sphere
Majorizing sequences for iterative procedures in Banach spaces
The recovery of ridge functions on the hypercube suffers from the curse of dimensionality
Algorithms for quaternion polynomial root-finding
Optimal lower bounds for cubature error on the sphere S 2
On the root mean square weighted L 2 discrepancy of scrambled nets
The rank of random regular digraphs of constant degree
Uniform weak tractability of multivariate problems with increasing smoothness
Complexity of fixed points, I
What Is the Complexity of Solution-Restricted Operator Equations?
Optimal approximation order of piecewise constants on convex partitions
Iteration, Inequalities, and Differentiability in Analog Computers
Sharp estimates for the covering numbers of the Weierstrass fractal kernel
Computing the Topological Degree with Noisy Information
One-Way Communication Complexity of Computing a Collection of Rational Functions
Input-Output Identifiability of Continuous-Time Linear Systems
Linear Algorithms with Finite Deviation
On the Randomized Error of Polynomial Methods for Eigenvector and Eigenvalue Estimates
Lower bounds on the minimal dispersion of point sets via cover-free families
Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions
Optimal pointwise sampling for L 2 approximation
Solving non-differentiable equations by a new one-point iterative method with memory
Optimal search algorithm for extrema of a discrete periodic bimodal function
Average Approximations and Moments of Measures
On Parallel Complexity of Nonsmooth Convex Optimization
Iterative root approximation in p-adic numerical analysis
Fast solvers of integral equations of the second kind: wavelet methods
1998 Best Paper Award Committee
Computing Riemann-Roch spaces via Puiseux expansions
A modified Newton-Lavrentiev regularization for nonlinear ill-posed Hammerstein-type operator equations
Quasi-random Simulation of Linear Kinetic Equations
Sharp lower error bounds for strong approximation of SDEs with piecewise Lipschitz continuous drift coefficient
Selecting relevant projections onto subsets of coordinates: A minimax dependence-based approach
Energies, group-invariant kernels and numerical integration on compact manifolds
Relaxed verification for continuous problems
A note on Korobov lattice rules for integration of analytic functions
On probabilistic results for the discrepancy of a hybrid-Monte Carlo sequence
2018 Joseph F. Traub Information-Based Complexity Young Researcher Award: Nomination deadline: Sept. 30 2018
A Proof of the Polynomiality of the Iri-Imai Method
Linear Complexity, k -Error Linear Complexity, and the Discrete Fourier Transform
Optimal adaptive solution of initial-value problems with unknown singularities
Newton's Method for Analytic Systems of Equations with Constant Rank Derivatives
Nonexact oracle inequalities, r -learnability, and fast rates
(s, ln κ )-weak tractability of linear problems
Nonlinear Approximation in Finite-Dimensional Spaces
IHP Meeting Special Issue
Gaussian mean boundedness of densely defined linear operators
Communication complexity of convex optimization
Matrix inversion in RNC 1
On the complexity of fitted toral dynamics
Nonasymptotic analysis of robust regression with modified Huber's loss
EC-tractability of approximation problems in function spaces defined over products of simplices
Wrap-Around L 2 -Discrepancy of Random Sampling, Latin Hypercube and Uniform Designs
Bypassing the quadrature exactness assumption of hyperinterpolation on the sphere
Regularization by truncated Cholesky factorization: A comparison of four different approaches
Parallel solution of toeplitzlike linear systems
Randomized Runge-Kutta method - Stability and convergence under inexact information
On optimal recovery and information complexity in numerical differentiation and summation
An Improved Upper Complexity Bound for the Topology Computation of a Real Algebraic Plane Curve
Expected dispersion of uniformly distributed points
EDITOR'S FOREWORD
On the expressiveness and decidability of o-minimal hybrid systems
Quasi-uniformity of minimal weighted energy points on compact metric spaces
The approximation characteristic of diagonal matrix in probabilistic setting
Computing topological degree using noisy information
Learnability in Hilbert Spaces with Reproducing Kernels
Metric estimates and membership complexity for Archimedean amoebae and tropical hypersurfaces
Approximation by quasi-interpolation operators and Smolyak's algorithm
On Asymptotically Optimal Methods of Prediction and Adaptive Coding for Markov Sources
A sequentially computable function that is not effectively continuous at any point
High probability bounds on AdaGrad for constrained weakly convex optimization
Accessibility of solutions of operator equations by Newton-like methods
Lattice-Nyström method for Fredholm integral equations of the second kind with convolution type kernels
On local analysis
Linearity of algorithms and a result of Ando
Pawel Przybylowicz wins the 2012 Information-Based Complexity Young Researcher Award
On Detecting Regularity of Functions: A Probabilistic Analysis
Central Limit Theorem for ( t , s )-sequences in base 2
On linearity of spline algorithms
On average case complexity of linear problems with noisy information
The Complexity and Effectiveness of Prediction Algorithms
Multivariate integration in C infinity ([0, 1] d ) is not strongly tractable
Variations on (0, s)-Sequences
Cubature formulas for function spaces with moderate smoothness
Gaussian rules on unbounded intervals
Algebraic complexities and algebraic curves over finite fields
Error propagation of general linear methods for ordinary differential equations
A lower bound on complexity of optimization under the r-fold integrated Wiener measure
Information-based numerical practice
Directed evaluation
An Efficient Algorithm for the Complex Roots Problem
Learning from hints in neural networks
On Speed versus Accuracy: Some Case Studies
The New k -Windows Algorithm for Improving the k -Means Clustering Algorithm
On Newton's method for solving generalized equations
Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth Theorem
Absolute value information for IBC problems
On Symbolic-Numeric Solving of Sine-Polynomial Equations
Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
Multi-sequences with d -perfect property
A Fast Version of the Schur.Cohn Algorithm
On the numerical computation of orbits of dynamical systems: The higher dimensional case
Mercer theorem for RKHS on noncompact sets
Complexity of Bezout's Theorem: III. Condition Number and Packing
Newton's method for sections on Riemannian manifolds: Generalized covariant alpha-theory
Information-based complexity of linear operator equations
Vector-valued reproducing kernel Banach spaces with applications to multi-task learning
Probabilistic and average linear widths of Sobolev space with Gaussian measure
Estimates for n-widths of sets of smooth functions on complex spheres
Random bit multilevel algorithms for stochastic differential equations
Lifting/Descending Processes for Polynomial Zeros
On the convergence rate of the component-by-component construction of good lattice rules
Multivariate Polynomials, Duality, and Structured Matrices
Tractability of approximation in the weighted Korobov space in the worst-case setting - a complete picture
Some complexity results in parallel matrix-based signal processing
Average-case results for zero finding
Heping Wang and Guiqiao Xu are the winners of the IBC Award 2020
Approximability of the Ground State Problem for Certain Ising Spin Glasses
Tractability of multivariate approximation over weighted standard Sobolev spaces
Distributing many points on spheres: Minimal energy and designs
Fast perfect simulation of Vervaat perpetuities
Real Data--Integer Solution Problems within the Blum-Shub-Smale Computational Model
Orthogonal rational functions and quadrature on the real half line
Optimal prediction of vector-valued functions from point samples
A strongly monotonic polygonal Euler scheme
New ultimate bound sets and exponential finite-time synchronization for the complex Lorenz system
On permutation-invariance of limit theorems
On the confusion and diffusion properties of Maiorana-McFarland's and extended Maiorana-McFarland's functions
Tractability properties of the weighted star discrepancy of regular grids
Numerical Integration of Harmonic Functions with Restricted Sampling Data
Positive Reducibility of the Interior of Filled Julia Sets
A Note from the Editor
Optimal learning of bandlimited functions from localized sampling
Optimal solution of nonlinear equations
Lower complexity bounds for interpolation algorithms
Space-filling designs on Riemannian manifolds
On Computing a Set of Points Meeting Every Cell Defined by a Family of Polynomials on a Variety
On the constructions and nonlinearity of binary vector-output correlation-immune functions
Analytical properties of resource-bounded real functionals
Dagstuhl 2000
On the Kostlan-Shub-Smale model for random polynomial systems. Variance of the number of roots
Landweber iteration for inverse problems using multiple repeated measurements data in Banach spaces
Complexity of Linear Problems with a Fixed Output Basis
A simple proof to the minimum distance of Z 4 -linear Goethals-like codes
Weak and quasi-polynomial tractability of approximation of infinitely differentiable functions
Shared generation of pseudo-random functions
A survey of randomized algorithms for control synthesis and performance verification
Component-by-Component Construction of Good Lattice Rules with a Composite Number of Points
Quantum approximation II. Sobolev embeddings
Computability and complexity in analysis
Intractability Results for Positive Quadrature Formulas and Extremal Problems for Trigonometric Polynomials
Stability of the elastic net estimator
Average case optimality
Extra-Updates Criterion for the Limited Memory BFGS Algorithm for Large Scale Nonlinear Optimizatio
Complexity Lower Bounds for Approximation Algebraic Computation Trees
A central limit theorem and improved error bounds for a hybrid-Monte Carlo sequence with applications in computational finance
Radial kernels and their reproducing kernel Hilbert spaces
Rectangular Matrix Multiplication Revisited
Optimality of orders one to three and beyond: Characterization and evaluation complexity in constrained nonconvex optimization
Tractability properties of the discrepancy in Orlicz norms
Convergence analysis of a regularized iterative scheme for solving nonlinear problems
The internal Steiner tree problem: Hardness and approximations
Polynomial evaluation and interpolation on special sets of points
A lower bound for the Sturm-Liouville eigenvalue problem on a quantum computer
Quadrature in Besov spaces on the Euclidean sphere
On negative dependence properties of Latin hypercube samples and scrambled nets
Statistical analysis of prediction in functional polynomial quantile regression
A problem that is easier to solve on the unit-cost algebraic RAM
Topological Complexity of the Range Searching
On approximation of band-limited signals
On the joint linear complexity profile of explicit inversive multisequences
On the linear complexity of Sidel'nikov sequences over nonprime fields
Function approximation and integration on the wiener space with noisy data
An explicit construction of point sets with large minimum Dick weight
Graeffe's, Chebyshev-like, and Cardinal's Processes for Splitting a Polynomial into Factors
Frances Kuo Wins the 2014 Information-Based Complexity Prize
Information complexity of equations of the second kind with compact operators in Hilbert space
Issue dedicated to Professor Henryk Wozniakowski
Open problems for tractability of multivariate integration
Utilizing Shelve Slots: Sufficiency Conditions for Some Easy Instances of Hard Problems
Bifurcations of limit cycles from Quintic Hamiltonian systems with a double figure eight loop
The Optimal Approximations for Solving Linear Ill-Posed Problems
There Exists a Problem Whose Computational Complexity Is Any Given Function of the Information Complexity
Worst case complexity of multivariate Feynman-Kac path integration
Note on quantization for signals with bounded (r + 1)st derivative
Optimal in-place transposition of rectangular matrices
On regularization algorithms in learning theory
Fast component-by-component construction of rank-1 lattice rules with a non-prime number of points
Construction of second-order orthogonal sliced Latin hypercube designs
A space-time adaptive low-rank method for high-dimensional parabolic partial differential equations
Randomized complexity of mean computation and the adaption problem
Probabilistic setting of information-based complexity
A survey of information-based complexity
s-numbers of compact embeddings of function spaces on quasi-bounded domains
Duality for digital sequences
Construction algorithms for higher order polynomial lattice rules
Fast interpolation of multivariate polynomials with sparse exponents
Lower bounds for the error of quadrature formulas for Hilbert spaces
Approximating Fixed Points of Weakly Contracting Mappings
Influence of numerical discretizations on hitting probabilities for linear stochastic parabolic systems
Adaptive approximation of the minimum of Brownian motion
Orthogonal projectors onto spaces of periodic splines
Lattice rule algorithms for multivariate approximation in the average case setting
Open type quasi-Monte Carlo integration based on Halton sequences in weighted Sobolev spaces
On the inverse of the discrepancy for infinite dimensional infinite sequences
The Minimal Radius of Galerkin Information for the Fredholm Problem of the First Kind
A note on the complexity of a phaseless polynomial interpolation
A note on EC-tractability of multivariate approximation in weighted Korobov spaces for the standard information class
An Ellipsoid Algorithm for the Computation of Fixed Points
The concept of sequential optimality for problems in numerical analysis
The Optimal Error of Monte Carlo Integration
Effective Pólya semi-positivity for non-negative polynomials on the simplex
ε-dimension in infinite dimensional hyperbolic cross approximation and application to parametric elliptic PDEs
A Two-Dimensional Bisection Envelope Algorithm for Fixed Points
Breaking the curse for uniform approximation in Hilbert spaces via Monte Carlo methods
Pseudorandom numbers and entropy conditions
Average Complexity for Linear Problems in a Model with Varying Information Noise
Bracketing numbers for axis-parallel boxes and applications to geometric discrepancy
Factoring bivariate sparse (lacunary) polynomials
A two-point Newton-like method of optimal fourth order convergence for systems of nonlinear equations
On the Intrinsic Complexity of Elimination Theory
Identity testing and interpolation from high powers of polynomials of large degree over finite fields
Average Case Complexity of Weighted Approximation and Integration over R +
On the complexity of orbit word problems
Randomly shifted lattice rules on the unit cube for unbounded integrands in high dimensions
Equivalence of anchored and ANOVA spaces via interpolation
Some current issues in quasi-Monte Carlo methods
Asymptotic analysis in multivariate average case approximation with Gaussian kernels
Explicit Cost Bounds of Algorithms for Multivariate Tensor Product Problems
The P ne NP conjecture in the context of real and complex analysis
Finding Zeros of Analytic Functions: alpha Theory for Secant Type Methods
Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets
Elimination of Constants from Machines over Algebraically Closed Fields
Sharp estimates for approximation numbers of non-periodic Sobolev embeddings
An Inequality for Trigonometric Polynomials and Its Application for Estimating the Entropy Numbers
On the complexity of Putinar's Positivstellensatz
NP-Completeness of graph decomposition problems
Worst case tractability of linear problems in the presence of noise: Linear information
An optimal algorithm for search of extrema of a bimodal function
Complexity of Banach space valued and parametric stochastic Itô integration
Generalized tractability for multivariate problems Part I: Linear tensor product problems and linear information
Quasi-Monte Carlo methods can be efficient for integration over products of spheres
Integrability of weak mixed first-order derivatives and convergence rates of scrambled digital nets
Weighted mesh algorithms for general Markov decision processes: Convergence and tractability
A procedure for increasing the convergence order of iterative methods from p to 5p for solving nonlinear system
A nonlocal functional promoting low-discrepancy point sets
Complexity of Nonlinear Two-Point Boundary-Value Problems
How complex is a random picture?
Random languages for nonuniform complexity classes
Stable splittings of Hilbert spaces of functions of infinitely many variables
Quiz games as a model for information hiding
On a partition with a lower expected L2-discrepancy than classical jittered sampling
On the complexity of computing the Hausdorff distance
Average case quantum lower bounds for computing the Boolean mean
Regularization operators for identifying the unknown source in the time-fractional convection-diffusion-reaction equation
Probabilistic analysis of numerical integration algorithms
My dream quadrature rule
Efficient approximation of the solution of certain nonlinear reaction-diffusion equations with small absorption
Approximating Complex Polynomial Zeros: Modified Weyl's Quadtree Construction and Improved Newton's Iteration
Propagation rules for (u,m,e,s)-nets and (u,e,s)-sequences
Faster polynomial multiplication over finite fields using cyclotomic coefficient rings
Elastic-net regularization in learning theory
On the topology of algorithms, I
Programmed interactions in higher-order neural networks: The outer-product algorithm
On the approximation of vector-valued functions by volume sampling
Randomized approximation of Sobolev embeddings, III
n -Widths of H p -spaces in L q (-1, 1)
Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time
Tractability of tensor product problems in the average case setting
On the hierarchy and extension of monotonically computable real numbers
Component-by-component constructions achieve the optimal rate of convergence for multivariate integration in weighted Korobov and Sobolev spaces
Deep ReLU neural network approximation in Bochner spaces and applications to parametric PDEs
Average Error Bounds of Best Approximation of Continuous Functions on the Wiener Space
Improved algorithms for computing determinants and resultants
On learning a union of half spaces
Expected multivolumes of random amoebas
Termination Criteria for Linear Problems
On the complexity of the resolvent representation of some prime differential ideals
Tree Complexity and a Doubly Exponential Gap between Structured and Random Sequences
Encoding and recovery of operator values
A fast algorithm for the discrete laplace transformation
Asymptotic setting (revisited): analysis of a boundary-value problem and a relation to a classical approximation result
Thomas Daun, Leszek Plaskota, Greg W. Wasilkowski Win the 2011 Best Paper Award
Tractability through increasing smoothness
Optimal learning rates for least squares regularized regression with unbounded sampling
Choosing Optimal Parameters in Iterative Processes
On the probabilistic complexity of finding an approximate solution for linear programming
Nonlinear Tikhonov regularization in Hilbert scales for inverse learning
Software Engineering and complexity in effective Algebraic Geometry
Gelfand and Kolmogorov numbers of Sobolev embeddings of weighted function spaces