Search Results - typical-case computational complexity

Disordered systems insights on computational hardness by Gamarnik, David, Moore, Cristopher, Zdeborová, Lenka

Get full text

Computational complexity of deep learning: fundamental limitations and empirical phenomena by Barak, Boaz, Carrell, Annabelle, Favero, Alessandro, Li, Weiyu, Stephan, Ludovic, Zlokapa, Alexander

Get full text

Statistical mechanics of the maximum-average submatrix problem by Erba, Vittorio, Krzakala, Florent, Pérez Ortiz, Rodrigo, Zdeborová, Lenka

Get full text

Biased thermodynamics can explain the behaviour of smart optimization algorithms that work above the dynamical threshold by Giorgio Cavaliere, Angelo, Ricci-Tersenghi, Federico

Get full text

Generic properties of a computational task predict human effort and performance by Franco, Juan Pablo, Yadav, Nitin, Bossaerts, Peter, Murawski, Carsten

“… Specifically, we introduce two measures, typical-case complexity (TCC), a measure of average hardness of a random ensemble of instances, and instance complexity (IC…”
Get full text

AN ACCURATE AND EFFICIENT ALGORITHM FOR DETECTION OF RADIO BURSTS WITH AN UNKNOWN DISPERSION MEASURE, FOR SINGLE-DISH TELESCOPES AND INTERFEROMETERS by Zackay, Barak, Ofek, Eran O.

“… Our algorithm has a low theoretical complexity of , where Nf, Nt, and NΔ are the numbers of frequency bins, time bins, and dispersion measure bins, respectively…”
Get full text

Optimizing rural building design with an intelligent framework integrating BES ANN and MCDM by Duan, Zhongcheng, Zhang, Renyong, Zhao, Yidi, Xie, Chao, Ma, Quanming

“… and computational complexity. A case study of a typical rural house in Chuzhou…”
Get full text

Online Deflection Estimation of X-Axis Beam on Positioning Machine by Xuan Wang, Huijun Gao, Kaynak, Okyay, Weichao Sun

“… The finite-element method (FEM) is the most common method used to investigate deflections. However, it has such a high computational complexity that it cannot be used in real-time deflection correction applications…”
Get full text

Quantum Advantage via Efficient Postprocessing on Qudit Classical Shadow Tomography by Wang, Yu

“… In this Letter, we introduce a quantum approach based on qudit classical shadow tomography, significantly reducing computational complexity from O(d^{2}) down to O[poly(logd…”
Get full text

2+p-SAT: Relation of typical-case complexity to the nature of the phase transition by Monasson, Rémi, Zecchina, Riccardo, Kirkpatrick, Scott, Selman, Bart, Troyansky, Lidror

“…Heuristic methods for solution of problems in the NP‐complete class of decision problems often reach exact solutions, but fail badly at “phase boundaries,”…”
Get full text

Computational Experiments for Complex Social Systems: Integrated Design of Experiment System by Xue, Xiao, Yu, Xiangning, Zhou, Deyu, Wang, Xiao, Bi, Chongke, Wang, Shufang, Wang, Fei-Yue

“…), complexity science, and domain knowledge. However, in the process of applying computational experiments, the construction of experiment system not only considers a large number of artificial society models, but also involves a large amount…”
Get full text

Phase transitions of the typical algorithmic complexity of the random satisfiability problem studied with linear programming by Schawe, Hendrik, Bleim, Roman, Hartmann, Alexander K.

“…Here we study linear programming applied to the random K-SAT problem, a fundamental problem in computational complexity…”
Get full text

Average-Case Speedup for Product Formulas by Chen, Chi-Fang, Brandão, Fernando G. S. L.

“… For an accurate product formula approximation, the state-of-the-art gate complexity depends on the number of terms in the Hamiltonian and a local energy estimate…”
Get full text

Computational Experiments: A New Analysis Method for Cyber-Physical-Social Systems by Xue, Xiao, Shen, Yifan, Yu, Xiangning, Zhou, De-Yu, Wang, Xiao, Wang, Gang, Wang, Fei-Yue

“…) is used as a typical case study to verify the effectiveness of the proposed method by simulating different operation strategies…”
Get full text

Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey by Rothe, Jörg, Schend, Lena

“… to use computational complexity as a shield to protect elections against manipulation and control…”
Get full text

Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing by Papayannopoulos, Philippos

“… The two frameworks offer useful computability and complexity results about problems whose underlying domain is an uncountable space (such as ℝ or ℂ…”
Get full text

Clearcut: a fast implementation of relaxed neighbor joining by Sheneman, Luke, Evans, Jason, Foster, James A.

“… In contrast, RNJ realizes a typical-case time complexity on the order of N2logN without any significant qualitative difference in output…”
Get full text

The Smoothed Complexity of Computing Kemeny and Slater Rankings by Xia, Lirong, Zheng, Weiqiang

“…The computational complexity of winner determination under common voting rules is a classical and fundamental topic in the field of computational social choice…”
Get full text

A quasilinear complexity algorithm for the numerical simulation of scattering from a two-dimensional radially symmetric potential by Bremer, James

“… have running times which grow at least quadratically with the wavenumber k. Here, we describe a solver which applies only when the scattering potential is radially symmetric but whose running time is O(klog⁡(k)) in typical cases…”
Get full text

Efficient architectures for 1-D and 2-D lifting-based wavelet transforms by Hongyu Liao, Mandal, M.Kr, Cockburn, B.F.

“…The lifting scheme reduces the computational complexity of the discrete wavelet transform (DWT…”
Get full text