X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (1443) 1443
Conference Proceeding (1067) 1067
Book Chapter (106) 106
Dissertation (44) 44
Book / eBook (14) 14
Magazine Article (10) 10
Publication (7) 7
Web Resource (6) 6
Government Document (3) 3
Paper (1) 1
more...
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
np-complete problem (1181) 1181
np-complete (1145) 1145
computer science (847) 847
science & technology (801) 801
technology (582) 582
algorithms (411) 411
mathematics (322) 322
polynomials (295) 295
physical sciences (285) 285
engineering (242) 242
engineering, electrical & electronic (214) 214
np-complete problems (210) 210
mathematics, applied (179) 179
heuristic algorithms (171) 171
optimization (171) 171
computational complexity (166) 166
computer science, theory & methods (165) 165
algorithm design and analysis (162) 162
genetic algorithms (159) 159
computer science, information systems (154) 154
routing (142) 142
approximation algorithms (132) 132
computer science, hardware & architecture (132) 132
complexity (131) 131
costs (112) 112
graph theory (111) 111
graphs (104) 104
analysis (100) 100
artificial intelligence (98) 98
processor scheduling (95) 95
testing (92) 92
dna computing (84) 84
discrete mathematics and combinatorics (83) 83
computational modeling (80) 80
computer networks (79) 79
delay (76) 76
genetic algorithm (76) 76
approximation algorithm (75) 75
neural networks (75) 75
cost function (74) 74
telecommunications (74) 74
mathematical models (71) 71
research (70) 70
studies (70) 70
scheduling (69) 69
algorithm (68) 68
computer science, interdisciplinary applications (68) 68
networks (68) 68
theoretical computer science (68) 68
applied mathematics (67) 67
mathematical analysis (67) 67
simulated annealing (67) 67
scheduling algorithm (65) 65
very large scale integration (65) 65
computer science, artificial intelligence (63) 63
berechnungskomplexität (62) 62
computation (62) 62
np complete (62) 62
bandwidth (60) 60
computer simulation (59) 59
application software (58) 58
parallel processing (58) 58
physics (57) 57
complexity theory (56) 56
concurrent computing (56) 56
operations research & management science (55) 55
partitioning algorithms (55) 55
graph (51) 51
heuristic (51) 51
theory of computation (51) 51
algorithmus (50) 50
circuits (49) 49
quality of service (48) 48
approximation (47) 47
resource management (47) 47
computer science, software engineering (46) 46
distributed computing (46) 46
tree graphs (45) 45
educational institutions (44) 44
logic (44) 44
hardware (43) 43
clustering algorithms (42) 42
dynamic programming (42) 42
linear programming (42) 42
satisfiability (42) 42
traveling salesman problems (42) 42
usage (42) 42
encoding (41) 41
combinatorics (40) 40
graphentheorie (40) 40
network topology (40) 40
constraint optimization (39) 39
data structures (39) 39
bipartite graph (37) 37
boolean functions (37) 37
cryptography (37) 37
laboratories (37) 37
combinatorial optimization (36) 36
electronic mail (34) 34
graph coloring (34) 34
more...
Library Location Library Location
Library Location Library Location
X
Sort by Item Count (A-Z)
Filter by Count
Online Resources - Online (6) 6
Gerstein Science - Stacks (5) 5
Collection Dvlpm't (Acquisitions) - Closed Orders (1) 1
Collection Dvlpm't (Acquisitions) - Vendor file (1) 1
Engineering & Comp. Sci. - Stacks (1) 1
Mathematical Sciences - Missing (1) 1
Mathematical Sciences - Stacks (1) 1
Trinity College (John W Graham) - Stacks (1) 1
UTL at Downsview - May be requested (1) 1
UofT at Mississauga - Searching (1) 1
UofT at Mississauga - Stacks (1) 1
UofT at Scarborough - Stacks (1) 1
more...
Language Language
Language Language
X
Sort by Item Count (A-Z)
Filter by Count
English (2621) 2621
Japanese (79) 79
Chinese (25) 25
Czech (5) 5
German (4) 4
Portuguese (4) 4
French (3) 3
Russian (3) 3
Spanish (2) 2
Korean (1) 1
Swedish (1) 1
more...
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


2013, ISBN 9780691156491, x, 176 pages
The P-NP problem is the most important open problem in computer science, if not all of mathematics.The Golden Ticketprovides a nontechnical introduction to... 
Computer algorithms | NP-complete problems | Mathematics | Technology | MATHEMATICS | Programming | History & Philosophy | Algorithms | COMPUTERS
Book
Foundations and trends in theoretical computer science, ISSN 1551-305X, 12/2006, Volume 2, Issue 1, pp. 1 - 106
Journal Article
European journal of operational research, ISSN 0377-2217, 06/2010, Volume 203, Issue 3, pp. 635 - 639
Journal Article
International journal of foundations of computer science, ISSN 0129-0541, 02/2018, Volume 29, Issue 2, pp. 143 - 163
Journal Article
International journal of communication systems, ISSN 1074-5351, 03/2017, Volume 30, Issue 5, pp. e3050 - n/a
Summary In wireless rechargeable sensor networks, sensors are responsible for sensing environment and generating sensed data, and mobile devices are... 
NP‐complete | wireless rechargeable sensor network | data gathering | energy replenishment | NP-complete | Mobile devices | Information management | Sensors | Analysis | Methods | Data entry | Anchors | Networks | Charging | Mobile communication systems | Algorithms | Wireless networks | Recharging
Journal Article
Theoretical computer science, ISSN 0304-3975, 08/2019, Volume 782, pp. 79 - 90
The Firefighting problem is defined as follows. At time t=0, a fire breaks out at a vertex of a graph. At each time step t≥1, a firefighter permanently defends... 
NP-complete | Firefighting | Parameterized complexity | Kernelization | Computer Science, Theory & Methods | Technology | Computer Science | Science & Technology
Journal Article
2010, ISBN 1441971548, xiii, 239
The P=NP question is one of the great problems of science, which has intrigued computer scientists and mathematicians for decades. This guide, originating from... 
Machine theory | Computational complexity | Gödel, Kurt | Computer algorithms | Computer architecture | Algorithms | Mathematics of Computing | Computer Science | Theory of Computation | History of Computing | Algorithm Analysis and Problem Complexity | Mathematical Logic and Foundations
Book
Linear algebra and its applications, ISSN 0024-3795, 02/2021, Volume 610, pp. 52 - 58
Let M be a real r×c matrix, and let k be a positive integer. In the column subset selection problem (CSSP), we need to minimize the quantity ‖M−SA‖, where A... 
Column subset selection | NP-complete
Journal Article
Journal of combinatorial optimization, ISSN 1382-6905, 2/2018, Volume 35, Issue 2, pp. 613 - 631
Journal Article
Theoretical computer science, ISSN 0304-3975, 03/2003, Volume 296, Issue 2, pp. 295 - 326
Starting from the way the inter-cellular communication takes place by means of protein channels (and also from the standard knowledge about neuron... 
NP-complete problems | Membrane computing | Lindenmayer hierarchy | Natural computing | Chomsky hierarchy | P systems | Computer science | Analysis
Journal Article
SIAM journal on discrete mathematics, ISSN 0895-4801, 2017, Volume 31, Issue 1, pp. 172 - 189
The dimension of a partial order P is the minimum number of linear orders whose intersection is P. There are efficient algorithms to test if a partial order... 
Intersection graph | Triangle containment | NP-complete | Physical Sciences | Mathematics | Mathematics, Applied | Science & Technology
Journal Article
Theoretical computer science, ISSN 0304-3975, 11/2017, Volume 702, pp. 48 - 59
Bounding hulls such as convex hull, α-shape, χ-hull, concave hull, crust, etc. offer a wide variety of useful applications. In this paper, we explore another... 
α-Shape | Minimum area polygon | Convex hull | NP-complete | α-Concave hull | Approximation algorithm | Computer Science, Theory & Methods | Technology | Computer Science | Science & Technology
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 10/2015, Volume 193, pp. 80 - 93
We study the complexity of finding 2-factors with various restrictions as well as edge-decompositions in (the underlying graphs of) digraphs. In particular we... 
Monochromatic matchings |