Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Over two parts, this book examines the meaning of complexity in the context of systems both social and natural. Chapters cover such topics as the traveling salesman problem, models of opinion dynamics creation, a universal theory for knowledge formation in children, the evaluation of landscape organization and dynamics through information entropy indicators, and studying the performance of wind farms using artificial neural networks. We hope that this book will be useful to an audience interested in the different problems and approaches that are used within the theory of complexity.

Computational complexity. --- NP-complete problems.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Over two parts, this book examines the meaning of complexity in the context of systems both social and natural. Chapters cover such topics as the traveling salesman problem, models of opinion dynamics creation, a universal theory for knowledge formation in children, the evaluation of landscape organization and dynamics through information entropy indicators, and studying the performance of wind farms using artificial neural networks. We hope that this book will be useful to an audience interested in the different problems and approaches that are used within the theory of complexity.

Computational complexity. --- NP-complete problems.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

"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 P-NP, its rich history, and its algorithmic implications for everything we do with computers and beyond. In this informative and entertaining book, Lance Fortnow traces how the problem arose during the Cold War on both sides of the Iron Curtain, and gives examples of the problem from a variety of disciplines, including economics, physics, and biology. He explores problems that capture the full difficulty of the P-NP dilemma, from discovering the shortest route through all the rides at Disney World to finding large groups of friends on Facebook. But difficulty also has its advantages. Hard problems allow us to safely conduct electronic commerce and maintain privacy in our online lives. The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of the P-NP problem"--

Computer science --- NP-complete problems. --- Computer algorithms. --- Problems, NP-complete --- Computational complexity --- Algorithms --- NP-complete problems --- Computer algorithms --- Mathematics --- Physical Sciences & Mathematics --- Algebra --- MATHEMATICS / Mathematical Analysis. --- MATHEMATICS / Linear Programming. --- MATHEMATICS / History & Philosophy. --- COMPUTERS / Programming / Algorithms. --- Facebook. --- Frenemy. --- Hamiltonian paths. --- Internet. --- Ketan Mulmuley. --- Leonid Levin. --- Martin Hellman. --- NP problem. --- NP problems. --- NP-complete. --- P versus NP problem. --- P versus NP. --- Richard Feynman. --- Steve Cook. --- Twitter. --- Urbana algorithm. --- Whitfield Diffie. --- academic work. --- algebraic geometry. --- algorithm. --- algorithms. --- approximation. --- big data. --- computational problems. --- computer science. --- computers. --- computing. --- cryptography. --- cryptosystem. --- database. --- decryption. --- digital computers. --- efficient algorithms. --- efficient computation. --- encryption. --- factoring. --- fast computers. --- graph isomorphism. --- heuristics. --- linear programming. --- mathematics. --- max-cut. --- network security. --- networking. --- new technologies. --- parallel computation. --- perebor. --- prime numbers. --- problems. --- programming. --- public-key cryptography. --- quantum computers. --- quantum computing. --- quantum cryptography. --- quantum mechanics. --- quantum physical systems. --- research community. --- secret messages. --- social networking data. --- solution. --- teleportation.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Networks, communications, and computing have become ubiquitous and inseparable parts of everyday life. This book is based on a Special Issue of the Algorithms journal, and it is devoted to the exploration of the many-faceted relationship of networks, communications, and computing. The included papers explore the current state-of-the-art research in these areas, with a particular interest in the interactions among the fields.

communication traffic prediction --- intelligent traffic management --- deformable convolution --- attention mechanism --- the next generation of telecommunication (5G) --- deep learning --- reinforcement learning --- systematic review --- cellular networks --- underwater wireless sensor networks --- ant colony optimization algorithms --- clustering routing algorithms --- energy efficiency --- network lifetime --- unmanned aerial vehicles --- UAV placement --- metaheuristics --- routing --- NP-complete --- NP-hard --- approximation --- polynomial time algorithm --- disjoint connecting paths --- unsplittable flow --- network design

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This is volume 77 of Advances in Computers. Since 1960, annual volumes are produced containing chapters by some of the leading experts in the field of computers today. For 50 years these volumes offer ideas and developments that are changing our society. This volume presents eight different topics covering many different aspects of computer science. A wide range of subjects are covered from insights into the different ways individuals can interact with electronic devices to how common law is adapting to and impacting on the Internet.

Electronic data processing. --- Computers. --- Photography --- Information display systems. --- Computer interfaces --- NP-complete problems. --- Programming languages (Electronic computers) --- Computer software --- Software architecture. --- Online social networks. --- Electronic social networks --- Social networking Web sites --- Virtual communities --- Social media --- Social networks --- Sociotechnical systems --- Web sites --- Architecture, Software --- Computer software architecture --- Development of computer software --- Software development --- Computer languages --- Computer program languages --- Computer programming languages --- Machine language --- Electronic data processing --- Languages, Artificial --- Problems, NP-complete --- Computational complexity --- Interfaces, Computer --- Computer input-output equipment --- Interface circuits --- Data display systems --- Display systems, Information --- Dynamic display systems --- Electronic displays --- Computers --- Optical data processing --- Optoelectronic devices --- Teaching --- Digital photography --- Digital electronics --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Cybernetics --- Machine theory --- Calculators --- Cyberspace --- ADP (Data processing) --- Automatic data processing --- Data processing --- EDP (Data processing) --- IDP (Data processing) --- Integrated data processing --- Office practice --- Digital techniques. --- Development. --- Architecture --- Design --- Optical equipment --- Aids and devices --- Automation --- Information display systems --- NP-complete problems --- Software architecture --- Online social networks --- Digital techniques --- Development --- Communities, Online (Online social networks) --- Communities, Virtual (Online social networks) --- Online communities (Online social networks)