代码搜索：Hard
找到约 4,142 项符合「Hard」的源代码
代码结果 4,142
www.eeworm.com/read/143769/12844513
txt hard.txt
Data Structures and Algorithms
13 Hard or Intractable Problems
If a problem has an O(nk) time algorithm (where k is a constant), then we
class it as havin
www.eeworm.com/read/143769/12845231
txt hard.txt
Data Structures and Algorithms
13 Hard or Intractable Problems
If a problem has an O(nk) time algorithm (where k is a constant), then we
class it as havin
www.eeworm.com/read/140080/13110483
h hard.h
/*H**************************************************************************
* NAME: hard.h
*----------------------------------------------------------------------------
* Copyright (c) 20
www.eeworm.com/read/241323/13156513
m hard.m
%> calculates the partial cross sections for a hard sphere.
%> The program asks for a maximal angular momentum Lmax and displays
%> the successive sums partial cross sections up to Lmax. Not
www.eeworm.com/read/308695/13695976
bmp hard.bmp
www.eeworm.com/read/305700/13763085
m hard.m
function z = hard(x,lambda)
% z = hard(x,lambda)
%
% --- Hard threshold ----
%
% z is the solution of
%
% z= arg min_x = 0.5*|| y - x ||_2^2 + lambda || x ||_0,
%
z = x.*(ab
www.eeworm.com/read/146877/5734382
h hard.h
/*H**************************************************************************
* $RCSfile: hard.h,v $
*----------------------------------------------------------------------------
* Copyright (c) 20
www.eeworm.com/read/139083/5811130
h hard.h
/*H**************************************************************************
* NAME: hard.h
*----------------------------------------------------------------------------
* Copyright (c) 20
www.eeworm.com/read/137327/5825584
h hard.h
/*H**************************************************************************
* NAME: hard.h
*----------------------------------------------------------------------------
* Copyright (c) 20
www.eeworm.com/read/136812/5862041
seq-hard
1,1,2,1,2,2,3,1,2,2,3,2,3,3,4:1{(1's in binary nos)}:number of 1's in binary numbers
1,1,2,2,4,2,6,4,6,4,10:4{(phi(n))}:Euler's [totient|phi]{ function}|phi(n)
1,2,2,4,2,4,2,4,6,2:6{(diff of primes)}: