• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 247 matches

• 2021
• 
  Hai Huang, Na Ning, Xing Lin, Zhiwei Liu, Yu Bin, Zhao Shilei:
  An Improved wNAF Scalar-Multiplication Algorithm With Low Computational Complexity by Using Prime Precomputation. IEEE Access 9: 31546-31552 (2021)
• 
  Khang Le, Huy Nguyen, Quang Nguyen, Nhat Ho, Tung Pham, Hung Bui:
  On Robust Optimal Transport: Computational Complexity, Low-rank Approximation, and Barycenter Computation. CoRR abs/2102.06857 (2021)
• 2020
• 
  Seyed Hosein Mousavi, Jafar Pourrostam:
  Low computational complexity methods for decoding of STBC in the uplink of a massive MIMO system. EURASIP J. Wirel. Commun. Netw. 2020(1): 111 (2020)
• 
  Fatemeh Abdi, Parviz Amiri, Mohammad Hosien Refan, Manfred Reddig, Ralph Kennel:
  Novel Adaptive Controller for Buck Converter with High Resource Efficiency and Low Computational Complexity. J. Circuits Syst. Comput. 29(14): 2050230:1-2050230:21 (2020)
• 
  Farhad Pakdaman, Mahmoud Reza Hashemi, Mohammad Ghanbari:
  A low complexity and computationally scalable fast motion estimation algorithm for HEVC. Multim. Tools Appl. 79(17-18): 11639-11666 (2020)
• 
  Majid Zamani, Jure Sokolic, Dai Jiang, Francesco Renna, Miguel R. D. Rodrigues, Andreas Demosthenous:
  Accurate, Very Low Computational Complexity Spike Sorting Using Unsupervised Matched Subspace Learning. IEEE Trans. Biomed. Circuits Syst. 14(2): 221-231 (2020)
• 
  Raghda Abdulbaqi Mugher:
  A Low Computational Complexity Algorithm of PTS Technique for PAPR Reduction in the 4G and 5G Systems. Webology 17(2): 746-775 (2020)
• 
  Ali Asghar Abedi, Mohammad Reza Mosavi, Karim Mohammadi:
  Low Computational Complexity in Low-Cost GNSS Receivers. Wirel. Pers. Commun. 112(1): 37-59 (2020)
• 
  Mrinal Kumar, Ben Lee Volk:
  Lower Bounds for Matrix Factorization. Computational Complexity Conference 2020: 5:1-5:20
• 
  Robert Andrews:
  Algebraic Hardness Versus Randomness in Low Characteristic. Computational Complexity Conference 2020: 37:1-37:32
• 
  Scott Aaronson, Robin Kothari, William Kretschmer, Justin Thaler:
  Quantum Lower Bounds for Approximate Counting via Laurent Polynomials. Computational Complexity Conference 2020: 7:1-7:47
• 
  Prerona Chatterjee, Mrinal Kumar, Adrian She, Ben Lee Volk:
  A Quadratic Lower Bound for Algebraic Branching Programs. Computational Complexity Conference 2020: 2:1-2:21
• 
  Jacques Dark, Christian Konrad:
  Optimal Lower Bounds for Matching and Vertex Cover in Dynamic Graph Streams. Computational Complexity Conference 2020: 30:1-30:14
• 
  Nikhil Gupta, Chandan Saha, Bhargav Thankey:
  A Super-Quadratic Lower Bound for Depth Four Arithmetic Circuits. Computational Complexity Conference 2020: 23:1-23:31
• 
  Valentine Kabanets, Sajin Koroth, Zhenjian Lu, Dimitrios Myrisiotis, Igor Oliveira:
  Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates. Computational Complexity Conference 2020: 15:1-15:41
• 
  Susanna F. de Rezende, Jakob Nordström, Kilian Risse, Dmitry Sokolov:
  Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs. Computational Complexity Conference 2020: 28:1-28:24
• 
  Michael Saks, Rahul Santhanam:
  Circuit Lower Bounds from NP-Hardness of MCSP Under Turing Reductions. Computational Complexity Conference 2020: 26:1-26:13
• 
  Sepideh Mirzaei, Hossein Hosseini-Nejad, Amir M. Sodagar:
  Spike Detection Technique Based on Spike Augmentation with Low Computational and Hardware Complexity. EMBC 2020: 894-897
• 
  Stefan Weithoffer, Rami Klaimi, Charbel Abdel Nour, Norbert Wehn, Catherine Douillard:
  Low-complexity Computational Units for the Local-SOVA Decoding Algorithm. PIMRC 2020: 1-6
• 
  Liangjia Li, Yuling Luo, Junxiu Liu, Senhui Qiu, Lanhang Li:
  A Robust Watermarking Scheme with High Security and Low Computational Complexity. SecureComm (2) 2020: 439-454
• 
  Markus Bachmayr, Wolfgang Dahmen:
  Adaptive low-rank approximations for operator equations: Accuracy control and computational complexity. 75 Years of Mathematics of Computation 2020
• 
  Oded Goldreich:
  On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing. Computational Complexity and Property Testing 2020: 87-118
• 2019
• 
  Luis M. Briceño-Arias, Giovanni Chierchia, Émilie Chouzenoux, Jean-Christophe Pesquet:
  A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression. Comput. Optim. Appl. 72(3): 707-726 (2019)
• 
  Teerapat Sanguankotchakorn, Ganti V. Sowmya:
  Reducing the Computational Complexity of Massive MIMO using Pre-coding Techniques under Some Lower Orders. J. Commun. 14(6): 498-503 (2019)
• 
  Christopher G. Blake, Frank R. Kschischang:
  Upper and Lower Bounds on the Computational Complexity of Polar Encoding and Decoding. IEEE Trans. Inf. Theory 65(9): 5656-5673 (2019)
• 
  Lijie Chen, Dylan M. McKay, Cody D. Murray, R. Ryan Williams:
  Relations and Equivalences Between Circuit Lower Bounds and Karp-Lipton Theorems. Computational Complexity Conference 2019: 30:1-30:21
• 
  Lijie Chen, R. Ryan Williams:
  Stronger Connections Between Circuit Analysis and Circuit Lower Bounds, via PCPs of Proximity. Computational Complexity Conference 2019: 19:1-19:43
• 
  Matthew Coudron, William Slofstra:
  Complexity Lower Bounds for Computing the Approximately-Commuting Operator Value of Non-Local Games to High Precision. Computational Complexity Conference 2019: 25:1-25:20
• 
  Sumegha Garg, Ran Raz, Avishay Tal:
  Time-Space Lower Bounds for Two-Pass Learning. Computational Complexity Conference 2019: 22:1-22:39
• 
  Igor Carboni Oliveira, Ján Pich, Rahul Santhanam:
  Hardness Magnification near State-Of-The-Art Lower Bounds. Computational Complexity Conference 2019: 27:1-27:29

skipping 217 more matches