A query efficient non‐adaptive long code test with perfect completeness

Publisher： John Wiley & Sons Inc

E-ISSN： 1098-2418|47|2|386-406

ISSN： 1042-9832

Source： RANDOM STRUCTURES AND ALGORITHMS, Vol.47, Iss.2, 2015-09, pp. : 386-406

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces

By Baker Kearfott Ralph   Castille Jessie M.   Tyagi Gaurav  

Optimization Methods and Software, Vol. 29, Iss. 2, 2014-03 ,pp. : 430-441

Taylor & Francis Ltd

Access to resources Recommend Favorite

The relationship between user query accuracy and lines of code

By Chan H.C.  

International Journal of Human-Computer Studies, Vol. 51, Iss. 5, 1999-11 ,pp. : 851-864

Academic Press

Access to resources Recommend Favorite

Completeness and Non-Completeness Results with Respect to Read-Once Projections

By Bollig B.   Wegener I.  

Information and Computation, Vol. 143, Iss. 1, 1998-05 ,pp. : 24-33

Academic Press

Access to resources Recommend Favorite

A Test for the Completeness of the Root Vectors in the Tricomi Problem

By Bimenov M. A.   Kal'menov T. Sh.  

Differential Equations, Vol. 39, Iss. 10, 2003-10 ,pp. : 1503-1505

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Efficient algorithms for supergraph query processing on graph databases

By Zhang Shuo   Gao Xiaofeng   Wu Weili   Li Jianzhong   Gao Hong  

Journal of Combinatorial Optimization, Vol. 21, Iss. 2, 2011-02 ,pp. : 159-191

Springer Publishing Company

Access to resources Recommend Favorite