Search Problems
Search Problems is a computational problem type within the broader class of decision and optimization problems, distinguished by the requirement to find a specific solution or path that satisfies given constraints, rather than merely determining the existence of such a solution.
694
Publications
52.6K
Citations
1.4K
Authors
576
Institutions
Publications per year
2017–2026
97
Parents
694
Fred Glover · INFORMS Journal on Computing · 1990 · 5.6K citations
Joxan Jaffar, J.-L. Lassez · 1987 · 1.6K citations
Closest point search in lattices
Erik Agrell, Thomas Eriksson, Alexander Vardy et al. · IEEE Transactions on Information Theory · 2002 · 1.4K citations · Full text
1–5 of 694
1.4K
11
h-index
10
h-index
7
h-index
6
h-index
Daniel H. Wagner Associates (United States), United States
6 publications · 286 citations
6
h-index
1–5 of 1.4K
576
Carnegie Mellon University
Pittsburgh, United States
17 h-index
30 publications
3.6K citations
University of Southern California
Los Angeles, United States
12 h-index
22 publications
1.2K citations
Palo Alto Research Center
Palo Alto, United States
11 h-index
18 publications
1.9K citations
University of California San Diego
San Diego, United States
10 h-index
14 publications
6.4K citations
University of California, Berkeley
Berkeley, United States
10 h-index
16 publications
475 citations

Centre National de la Recherche Scientifique
Paris, France
9 h-index
21 publications
999 citations

University of Toronto
Toronto, Canada
9 h-index
14 publications
649 citations

University of British Columbia
Vancouver, Canada
8 h-index
12 publications
713 citations
1–8 of 576
15 publications · 1.5K citations
14
h-index
13 publications · 861 citations
12
h-index
11 publications · 395 citations
11
h-index
Conference · 11 publications · 1K citations
11
h-index
Conference · 9 publications · 1K citations
9
h-index
1–5