» książki » Computers - Computer Science
topmenu
 |
Programação Web3 e Blockchain: Um guia prático
ISBN: 9798300831226 / Portugalski / Miękka / 314 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. |
cena:
60,65 |
 |
The Hamiltonian Circuit Algorithm
ISBN: 9781466381377 / Angielski / Miękka / 34 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. We present a new polynomial-time algorithm for finding Hamiltonian circuits in graphs. It is shown that the algorithm always finds a Hamiltonian circuit in graphs that have at least three vertices and minimum degree at least half the total number of vertices. In the process, we also obtain a constructive proof of Dirac's famous theorem of 1952, for the first time. The algorithm finds a Hamiltonian circuit (respectively, tour) in all known examples of graphs that have a Hamiltonian circuit (respectively, tour). In view of the importance of the P versus NP question, we ask: does there exist a...
We present a new polynomial-time algorithm for finding Hamiltonian circuits in graphs. It is shown that the algorithm always finds a Hamiltonian circu...
|
cena:
60,69 |
 |
The Vertex Cover Algorithm
ISBN: 9781466384477 / Angielski / Miękka / 46 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. We present a new polynomial-time algorithm for finding minimal vertex covers in graphs. The algorithm finds a minimum vertex cover in all known examples of graphs. In view of the importance of the P versus NP question, we ask if there exists a graph for which the algorithm cannot find a minimum vertex cover. The algorithm is demonstrated by finding minimum vertex covers for several famous graphs, including two large benchmark graphs with hidden minimum vertex covers. We implement the algorithm in C++ and provide a demonstration program for Microsoft Windows.
We present a new polynomial-time algorithm for finding minimal vertex covers in graphs. The algorithm finds a minimum vertex cover in all known exampl...
|
cena:
60,69 |
 |
The Independent Set Algorithm
ISBN: 9781466387690 / Angielski / Miękka / 46 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. We present a new polynomial-time algorithm for finding maximal independent sets in graphs. As a corollary, we obtain new bounds on the famous Ramsey numbers in terms of the maximum and minimum vertex degrees of the corresponding Ramsey graphs. The algorithm finds a maximum independent set in all known examples of graphs. In view of the importance of the P versus NP question, we ask if there exists a graph for which the algorithm cannot find a maximum independent set. The algorithm is demonstrated by finding maximum independent sets for several famous graphs, including two large benchmark...
We present a new polynomial-time algorithm for finding maximal independent sets in graphs. As a corollary, we obtain new bounds on the famous Ramsey n...
|
cena:
60,69 |
 |
The Clique Algorithm
ISBN: 9781466391215 / Angielski / Miękka / 48 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. We present a new polynomial-time algorithm for finding maximal cliques in graphs. As a corollary, we obtain new bounds on the famous Ramsey numbers in terms of the maximum and minimum vertex degrees of the corresponding Ramsey graphs. The algorithm finds a maximum clique in all known examples of graphs. In view of the importance of the P versus NP question, we ask if there exists a graph for which the algorithm cannot find a maximum clique. The algorithm is demonstrated by finding maximum cliques for several famous graphs, including two large benchmark graphs with hidden maximum cliques. We...
We present a new polynomial-time algorithm for finding maximal cliques in graphs. As a corollary, we obtain new bounds on the famous Ramsey numbers in...
|
cena:
60,69 |
 |
The Graph Isomorphism Algorithm: Graph Isomorphism is in P
ISBN: 9781466394377 / Angielski / Miękka / 38 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. We present a new polynomial-time algorithm for determining whether two given graphs are isomorphic or not. We prove that the algorithm is necessary and sufficient for solving the Graph Isomorphism Problem in polynomial-time, thus showing that the Graph Isomorphism Problem is in P. The semiotic theory for the recognition of graph structure is used to define a canonical form of the sign matrix of a graph. We prove that the canonical form of the sign matrix is uniquely identifiable in polynomial-time for isomorphic graphs. The algorithm is demonstrated by solving the Graph Isomorphism Problem...
We present a new polynomial-time algorithm for determining whether two given graphs are isomorphic or not. We prove that the algorithm is necessary an...
|
cena:
60,69 |
 |
On the Scalability and Security of Bitcoin
ISBN: 9781530769452 / Angielski / Miękka / 196 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. |
cena:
60,69 |
 |
Game A.I. Made Easy: Designing Agents: With Unity3D Examples
ISBN: 9781792608957 / Angielski / Miękka / 270 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. |
cena:
60,69 |
| |
International Baccalaureate Computer Science: Topic 1: System Fundamentals
ISBN: 9781691210701 / Angielski / Miękka / 60 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. |
cena:
60,69 |
| |
Cloud Computing Concept
ISBN: 9788196189150 / Angielski Termin realizacji zamówienia: ok. 5-8 dni roboczych. |
cena:
60,69 |
 |
C, C++, C# Coding Concept
ISBN: 9788198703958 / Angielski Termin realizacji zamówienia: ok. 5-8 dni roboczych. |
cena:
60,69 |
 |
Java, Python, R Coding Concept
ISBN: 9788199693432 / Angielski Termin realizacji zamówienia: ok. 5-8 dni roboczych. |
cena:
60,69 |
 |
The Bit and the Pendulum: From Quantum Computing to M Theory--The New Physics of Information
ISBN: 9780471399742 / Angielski / Miękka / 288 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Funny, clear, deep, and right on target. Siegfried] lets us get a handle on ideas that are essential for understanding the evolving world.
-K. C. Cole, author of The Universe and the Teacup ""An eager, ambitious book. A stimulating, accessible introduction to scientific theory."" -Dallas Morning News An award-winning journalist surveys the horizon of a new revolution in science Everything in the universe, from the molecules in our bodies to the heart of a black hole, is made up of bits of information. This is the radical idea at the center of the new physics of information,... Funny, clear, deep, and right on target. Siegfried] lets us get a handle on ideas that are essential for understanding the evolving world.
-K. C. ... |
cena:
61,47 |
 |
Spatial Computing
ISBN: 9780262538046 / Angielski / Miękka / 256 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. |
cena:
61,47 |
 |
AI Assistants
ISBN: 9780262542555 / Angielski / Miękka / 288 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. |
cena:
61,47 |
 |
Cyber-Physical Attack Defenses: Preventing Damage to Buildings and Utilities
ISBN: 9781546648307 / Angielski / Miękka / 184 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. |
cena:
61,50 |
 |
The Geek Squad Guide to Solving Any Computer Glitch
ISBN: 9780684843438 / Angielski / Miękka / 224 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. IT CAN'T CRASH, IT WON'T PUT YOU ON HOLD, AND IT NEVER TAKES LUNCH BREAKS.
If you've ever used a personal computer (and who hasn't), you know what these moments are... IT CAN'T CRASH, IT WON'T PUT YOU ON HOLD, AND IT NEVER TAKES LUNCH BREAKS.
|
cena:
61,61 |
 |
Python for Beginners: Learn It as Easy as Pie
ISBN: 9780578771809 / Angielski / Miękka / 134 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. |
cena:
61,61 |
 |
Information Technology Essentials: An Introduction to Information Technology
ISBN: 9781733009423 / Angielski / Miękka / 206 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. |
cena:
61,61 |
| |
Word 2019 for Beginners 2021: Comprehensive Beginners to Professional Guide for Microsoft Office Word 2019
ISBN: 9798500538741 / Angielski / Miękka / 248 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. |
cena:
61,91 |
Czytaj nas na:
Zobacz: Księgarnia Czeska | Wydawnictwo Książkowe Klimaty | Mapa strony | Lista autorów
KrainaKsiazek.PL - Księgarnia Internetowa
KrainaKsiazek.PL - Księgarnia Internetowa
