Partial Search
Partial Search is a type of patent search strategy that focuses on a subset of claims within a patent application, distinguished by its limitation to specific inventions or technical features rather than encompassing the full scope of all claimed subject matter.
62
Publications
4.5K
Citations
154
Authors
96
Institutions
Publications per year
2017–2026
5
Parents
62
No Free Lunch Theorems for Search
David H. Wolpert, William G. Macready · RePEc: Research Papers in Economics · 1995 · 930 citations
1–5 of 62
154
5
h-index
2
h-index
Nanjing University of Aeronautics and Astronautics, China
2 publications · 202 citations
2
h-index
2
h-index
2
h-index
1–5 of 154
96
Stony Brook University
Stony Brook, United States
6 h-index
6 publications
129 citations
State University of New York
Albany, United States
5 h-index
5 publications
116 citations

Tata Institute of Fundamental Research
Mumbai, India
2 h-index
3 publications
152 citations
Chung Yuan Christian University
Taoyuan City, Taiwan
2 h-index
5 publications
267 citations

Harbin Institute of Technology
Harbin, China
2 h-index
6 publications
158 citations

Nanjing University of Aeronautics and Astronautics
Nanjing, China
2 h-index
2 publications
202 citations

Aarhus University
Aarhus, Denmark
2 h-index
4 publications
130 citations
Purdue University West Lafayette
West Lafayette, United States
2 h-index
4 publications
192 citations
1–8 of 96
4 publications · 168 citations
4
h-index
4 publications · 110 citations
4
h-index
TPDS · 2 publications · 120 citations
2
h-index
2 publications · 58 citations
2
h-index
Repository · 2 publications · 941 citations
2
h-index
1–5