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

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

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

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

NP-complete problem | RGB-digraphs | Triangle edge deletion | Computer science

Journal Article

2014, ISBN 8132216644, Volume 243, 10

Reference

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

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

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

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

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

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

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

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

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

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

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

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

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.