Descriptive Complexity
Neil Immerman
ዲሴም 2012 · Springer Science & Business Media
ኢ-መጽሐፍ
268
ገጾች
reportየተሰጡት ደረጃዎች እና ግምገማዎች የተረጋገጡ አይደሉም የበለጠ ለመረዳት
ስለዚህ ኢ-መጽሐፍ
A basic issue in computer science is the complexity of problems. Computational complexity measures how much time or memory is needed as a function of the input problem size. Descriptive complexity is concerned with problems which may be described in first-order logic. By virtue of the close relationship between logic and relational databses, it turns out that this subject has important applications to databases such as analysing the queries computable in polynomial time, analysing the parallel time needed to compute a query, and the analysis of nondeterministic classes. This book is written as a graduate text and so aims to provide a reasonably self-contained introduction to this subject. The author has provided numerous examples and exercises to further illustrate the ideas presented.
ለዚህ ኢ-መጽሐፍ ደረጃ ይስጡ
ምን እንደሚያስቡ ይንገሩን።
የንባብ መረጃ
ዘመናዊ ስልኮች እና ጡባዊዎች
የGoogle Play መጽሐፍት መተግበሪያውን ለAndroid እና iPad/iPhone ያውርዱ። ከእርስዎ መለያ ጋር በራስሰር ይመሳሰላል እና ባሉበት የትም ቦታ በመስመር ላይ እና ከመስመር ውጭ እንዲያነቡ ያስችልዎታል።
ላፕቶፖች እና ኮምፒውተሮች
የኮምፒውተርዎን ድር አሳሽ ተጠቅመው በGoogle Play ላይ የተገዙ ኦዲዮ መጽሐፍትን ማዳመጥ ይችላሉ።
ኢሪደሮች እና ሌሎች መሳሪያዎች
እንደ Kobo ኢ-አንባቢዎች ባሉ ኢ-ቀለም መሣሪያዎች ላይ ለማንበብ ፋይል አውርደው ወደ መሣሪያዎ ማስተላለፍ ይኖርብዎታል። ፋይሎቹን ወደሚደገፉ ኢ-አንባቢዎች ለማስተላለፍ ዝርዝር የእገዛ ማዕከል መመሪያዎቹን ይከተሉ።
