X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (1622) 1622
Conference Proceeding (1108) 1108
Dissertation (81) 81
Publication (80) 80
Book Chapter (45) 45
Book / eBook (17) 17
Web Resource (6) 6
Magazine Article (5) 5
Government Document (3) 3
Book Review (2) 2
Paper (2) 2
Reference (2) 2
more...
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
np-complete problem (1208) 1208
np-complete (1169) 1169
computer science (497) 497
algorithms (484) 484
polynomials (299) 299
np-complete problems (242) 242
mathematics, applied (237) 237
engineering, electrical & electronic (226) 226
computer science, theory & methods (222) 222
optimization (208) 208
mathematics (184) 184
computer science, information systems (171) 171
heuristic algorithms (168) 168
computational complexity (166) 166
genetic algorithms (164) 164
algorithm design and analysis (162) 162
graphs (156) 156
complexity (151) 151
computer science, hardware & architecture (150) 150
approximation algorithms (147) 147
routing (141) 141
algorithm (137) 137
studies (121) 121
graph theory (117) 117
costs (114) 114
artificial intelligence (102) 102
analysis (101) 101
processor scheduling (94) 94
computation (92) 92
networks (89) 89
testing (89) 89
mathematical models (87) 87
dna computing (84) 84
computer networks (79) 79
genetic algorithm (78) 78
computational modeling (77) 77
delay (77) 77
telecommunications (77) 77
mathematical analysis (76) 76
cost function (75) 75
research (75) 75
computer science, artificial intelligence (73) 73
approximation algorithm (72) 72
neural networks (72) 72
berechnungskomplexität (71) 71
scheduling (70) 70
simulated annealing (70) 70
computer science, interdisciplinary applications (67) 67
scheduling algorithm (66) 66
graph (65) 65
very large scale integration (65) 65
approximation (64) 64
bandwidth (61) 61
computer science, software engineering (60) 60
parallel processing (60) 60
operations research & management science (59) 59
application software (57) 57
complexity theory (57) 57
computer simulation (56) 56
concurrent computing (56) 56
heuristic (56) 56
partitioning algorithms (55) 55
theory of computation (55) 55
np complete (54) 54
theoretical computer science (54) 54
algorithmus (53) 53
discrete mathematics and combinatorics (53) 53
satisfiability (53) 53
circuits (52) 52
quality of service (50) 50
distributed computing (47) 47
linear programming (47) 47
usage (47) 47
combinatorial optimization (46) 46
hardware (46) 46
logic (46) 46
resource management (46) 46
traveling salesman problems (46) 46
tree graphs (45) 45
educational institutions (44) 44
graphentheorie (43) 43
clustering algorithms (42) 42
applied mathematics (40) 40
cryptography (40) 40
data structures (40) 40
dynamic programming (40) 40
encoding (40) 40
trees (40) 40
constraint optimization (39) 39
graph coloring (39) 39
network topology (39) 39
combinatorics (38) 38
operations research (38) 38
dna (37) 37
index medicus (37) 37
boolean functions (36) 36
laboratories (36) 36
bipartite graph (35) 35
computers (35) 35
information technology (35) 35
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 (4) 4
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 (2648) 2648
Japanese (59) 59
Chinese (41) 41
French (6) 6
Russian (3) 3
Spanish (2) 2
German (1) 1
Korean (1) 1
more...
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


2013, ISBN 0691156492
"The P-NP problem is the most important open problem in computer science, if not all of mathematics. The Golden Ticket provides a nontechnical introduction to... 
Computer algorithms | NP-complete problems
Web Resource
2013, ISBN 0691156492
"The P-NP problem is the most important open problem in computer science, if not all of mathematics. The Golden Ticket provides a nontechnical introduction to... 
Computer algorithms | NP-complete problems
Web Resource
2013, ISBN 0691156492
"The P-NP problem is the most important open problem in computer science, if not all of mathematics. The Golden Ticket provides a nontechnical introduction to... 
Computer algorithms | NP-complete problems
Web Resource
Theoretical Computer Science, ISSN 0304-3975, 10/2019, Volume 788, pp. 2 - 11
In this paper, we revisit the triangle edge deletion problem a variant of feedback arc set problem which is one of the Karp's 21 NP-complete problems. Given a... 
NP-complete problem | RGB-digraphs | Triangle edge deletion | Computer science
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 2018
Alice wants to join a new social network, and influence its members to adopt a new product or idea. Each person v in the network has a certain threshold t(v)... 
Greedy algorithms | Influence maximization | Graphs | Social networks | NP-complete
Journal Article
2013, ISBN 9783642375019, Volume 212, 6
Reference
ISBN 9780691156491, x, 176 pages
Book
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
Book
2013, ISBN 9780691156491, x, 176 pages
The P-NP problem is the most important open problem in computer science, if not all of mathematics. Simply stated, it asks whether every problem whose solution... 
Computer algorithms | NP-complete problems | Mathematics | Technology
Book
Theoretical Computer Science, ISSN 0304-3975, 08/2019, Volume 782, pp. 79 - 90
The problem is defined as follows. At time , a fire breaks out at a vertex of a graph. At each time step , a firefighter permanently defends (protects) an... 
NP-complete | Firefighting | Parameterized complexity | Kernelization | BOUNDS | COMPLEXITY | COMPUTER SCIENCE, THEORY & METHODS | Kemelization | GRAPHS
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 07/2019, Volume 776, pp. 64 - 74
A -partition of a graph is a vertex-partition of into two non-empty sets satisfying that for . We determine, for all positive integers , the complexity of... 
2-partition | Minimum degree | [formula omitted]-complete | Polynomial time | NP-complete | Computer science | Logic | Mathematics
Journal Article
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2018, Volume 11270, pp. 237 - 255
Journal Article
Scientific Reports, ISSN 2045-2322, 03/2017, Volume 7, Issue 1, pp. 44370 - 44370
This paper draws attention to a hardware system which can be engineered so that its intrinsic physics is described by the generalized Ising model and can... 
COHERENT ISING MACHINE | NETWORKS | MODELS | NP-COMPLETE PROBLEMS | SPINS | MULTIDISCIPLINARY SCIENCES | Temperature effects | Traveling salesman problem | Stochasticity | Physics - Mesoscale and Nanoscale Physics
Journal Article
ACM Journal on Emerging Technologies in Computing Systems (JETC), ISSN 1550-4832, 05/2019, Volume 15, Issue 3, pp. 1 - 10
Field-coupled Nanocomputing  (FCN) technologies provide an alternative to conventional CMOS-based computation technologies and are characterized by... 
field-coupled nanocomputing | routing | Emerging technology | NP-complete | placement
Journal Article
Information Sciences, ISSN 0020-0255, 10/2019, Volume 501, pp. 30 - 49
Spiking neural P systems, or SN P systems, are parallel and nondeterministic computing models inspired by spike processing of neurons. A variant of SN P... 
Spiking neural P systems | Membrane computing | Matrix representation | NP-Complete | Rules on synapse | WORKING | SUBSET SUM | COMPUTER SCIENCE, INFORMATION SYSTEMS
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 10/2018, Volume 745, pp. 53 - 62
In this paper, we study the conflict-free coloring of graphs induced by neighborhoods. A coloring of a graph is conflict-free if every vertex has a uniquely... 
NP-complete | Parameterized complexity | Conflict-free coloring | COMPUTER SCIENCE, THEORY & METHODS | COMPLEXITY | Computer science | Algorithms
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 2018
Alice wants to join a new social network, and influence its members to adopt a new product or idea. Each person v in the network has a certain threshold t(v)... 
Influence maximization | Social networks | NP-complete | Polytime algorithms for trees, paths, and cliques | Dynamic programming
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 03/2019, Volume 257, pp. 276 - 288
A graph is if for every the open neighbourhood of is nonempty and induces a connected graph in . We characterize locally connected graphs of order with less... 
Locally connected | NP-complete | Polynomial time algorithm | Hamiltonian | MATHEMATICS, APPLIED | Computer science | Graphs
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 04/2014, Volume 529, pp. 61 - 68
P systems are a class of distributed and parallel computation models inspired by the structure and the functioning of living cells. P systems have been used to... 
Membrane computing | NP-complete problem | P system | Time-free solution | Semi-uniform solution | COMPUTER SCIENCE, THEORY & METHODS | POLARIZATIONS | Computer science
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.