Scrigroup - Documente si articole

Username / Parola inexistente      

Home Documente Upload Resurse Alte limbi doc  

CATEGORII DOCUMENTE




BulgaraCeha slovacaCroataEnglezaEstonaFinlandezaFranceza
GermanaItalianaLetonaLituanianaMaghiaraOlandezaPoloneza
SarbaSlovenaSpaniolaSuedezaTurcaUcraineana

AdministrationAnimalsArtBiologyBooksBotanicsBusinessCars
ChemistryComputersComunicationsConstructionEcologyEconomyEducationElectronics
EngineeringEntertainmentFinancialFishingGamesGeographyGrammarHealth
HistoryHuman-resourcesLegislationLiteratureManagementsManualsMarketingMathematic
MedicinesMovieMusicNutritionPersonalitiesPhysicPoliticalPsychology
RecipesSociologySoftwareSportsTechnicalTourismVarious

Mathematic

+ Font mai mare | - Font mai mic






Trimite pe Messenger

Np-completeness

NP-COMPLETENESS All of the algorithms we have studied thus far have been polynomial-time algorithms: on inputs of size n, their worst-case running time is O(nk) for some constant k. It is natural to wonder whether all problems can be solved
Citeste tot ... 15487 cuvinte
Dimensiune mare
+ cu imagini
doc mare articol cu poze

Algebraic number systems and boolean matrix multiplication

Algebraic number systems and boolean matrix multiplication The properties of matrix addition and multiplication depend on the properties of the underlying number system. In this section, we define three different kinds of underlying number syst
Citeste tot ... 1412 cuvinte
Dimensiune mica
+ cu imagini
fisier mic articol cu poze

String matching

STRING MATCHING Finding all occurrences of a pattern in a text is a problem that arises frequently in text-editing programs. Typically, the text is a document being edited, and the pattern searched for is a particular word supplied by the u
Citeste tot ... 10374 cuvinte
Dimensiune mare
+ cu imagini
doc mare articol cu poze

Approximation algorithms

APPROXIMATION ALGORITHMS Many problems of practical significance are NP-complete but are too important to abandon merely because obtaining an optimal solution is intractable. If a problem is NP-complete, we are unlikely to find a polynomial
Citeste tot ... 6302 cuvinte
Dimensiune mare
+ cu imagini
doc mare articol cu poze


Alte pagini

1 1 2 3








Politica de confidentialitate

Termeni si conditii de utilizare | Contact
© SCRIGROUP 2019 . All rights reserved