Výsledky vyhledávání - typical-case computational complexity

  1. 1
  2. 2
  3. 3
  4. 4
  5. 5

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

    ISSN: 0022-2496, 1096-0880
    Vydáno: Elsevier Inc 01.09.2021
    Vydáno v Journal of mathematical psychology (01.09.2021)
    “… Specifically, we introduce two measures, typical-case complexity (TCC), a measure of average hardness of a random ensemble of instances, and instance complexity (IC…”
    Získat plný text
    Journal Article
  6. 6

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

    ISSN: 0004-637X, 1538-4357
    Vydáno: Philadelphia The American Astronomical Society 20.01.2017
    Vydáno v The Astrophysical journal (20.01.2017)
    “… 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…”
    Získat plný text
    Journal Article
  7. 7

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

    ISSN: 2045-2322, 2045-2322
    Vydáno: London Nature Publishing Group UK 27.08.2025
    Vydáno v Scientific reports (27.08.2025)
    “… and computational complexity. A case study of a typical rural house in Chuzhou…”
    Získat plný text
    Journal Article
  8. 8

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

    ISSN: 1083-4435, 1941-014X
    Vydáno: New York IEEE 01.02.2016
    “… 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…”
    Získat plný text
    Journal Article
  9. 9

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

    ISSN: 0031-9007, 1079-7114, 1079-7114
    Vydáno: United States 14.11.2025
    Vydáno v Physical review letters (14.11.2025)
    “… 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…”
    Získat plný text
    Journal Article
  10. 10

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

    ISSN: 1042-9832, 1098-2418
    Vydáno: New York John Wiley & Sons, Inc 01.10.1999
    Vydáno v Random structures & algorithms (01.10.1999)
    “…Heuristic methods for solution of problems in the NP‐complete class of decision problems often reach exact solutions, but fail badly at “phase boundaries,”…”
    Získat plný text
    Journal Article
  11. 11

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

    ISSN: 2329-9266, 2329-9274
    Vydáno: Piscataway Chinese Association of Automation (CAA) 01.05.2024
    Vydáno v IEEE/CAA journal of automatica sinica (01.05.2024)
    “…), 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…”
    Získat plný text
    Journal Article
  12. 12

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

    ISSN: 1932-6203, 1932-6203
    Vydáno: United States Public Library of Science 19.04.2019
    Vydáno v PloS one (19.04.2019)
    “…Here we study linear programming applied to the random K-SAT problem, a fundamental problem in computational complexity…”
    Získat plný text
    Journal Article
  13. 13

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

    ISSN: 0010-3616, 1432-0916
    Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.02.2024
    “… 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…”
    Získat plný text
    Journal Article
  14. 14

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

    ISSN: 2168-2216, 2168-2232
    Vydáno: New York IEEE 01.02.2024
    “…) is used as a typical case study to verify the effectiveness of the proposed method by simulating different operation strategies…”
    Získat plný text
    Journal Article
  15. 15

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

    ISSN: 1012-2443, 1573-7470
    Vydáno: Dordrecht Springer Netherlands 01.07.2013
    “… to use computational complexity as a shield to protect elections against manipulation and control…”
    Získat plný text
    Journal Article
  16. 16

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

    ISSN: 0039-7857, 1573-0964
    Vydáno: Dordrecht Springer Science + Business Media 01.12.2021
    Vydáno v Synthese (Dordrecht) (01.12.2021)
    “… The two frameworks offer useful computability and complexity results about problems whose underlying domain is an uncountable space (such as ℝ or ℂ…”
    Získat plný text
    Journal Article
  17. 17

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

    ISSN: 1367-4803, 1367-4811, 1460-2059, 1367-4811
    Vydáno: Oxford Oxford University Press 15.11.2006
    Vydáno v Bioinformatics (15.11.2006)
    “… In contrast, RNJ realizes a typical-case time complexity on the order of N2logN without any significant qualitative difference in output…”
    Získat plný text
    Journal Article
  18. 18

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

    ISSN: 2331-8422
    Vydáno: Ithaca Cornell University Library, arXiv.org 25.10.2020
    Vydáno v arXiv.org (25.10.2020)
    “…The computational complexity of winner determination under common voting rules is a classical and fundamental topic in the field of computational social choice…”
    Získat plný text
    Paper
  19. 19

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

    ISSN: 0021-9991, 1090-2716
    Vydáno: Cambridge Elsevier Inc 01.06.2020
    Vydáno v Journal of computational physics (01.06.2020)
    “… 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…”
    Získat plný text
    Journal Article
  20. 20

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

    ISSN: 1053-587X, 1941-0476
    Vydáno: New York, NY IEEE 01.05.2004
    “…The lifting scheme reduces the computational complexity of the discrete wavelet transform (DWT…”
    Získat plný text
    Journal Article