العربية
italiano
english
français
española
中国
日本の
العربية
Deutsch
한국어
Português
Russian
مقالات كاملة
فئات
C#
PHP
PYTHON
JAVA
SQL SERVER
MYSQL
HTML
CSS
JQUERY
VUE
ReactJS
انت تكتب
المستعمل
تسجيل الدخول
تسجيل
استعادة كلمة السر
العلامات
علامات اللغة
Back-end
C#
PHP
JAVA
PYTHON
Database
Sql server
Mysql
Front-end
HTML
CSS
JQUERY
ANGULARJS
REACT
VUE.JS
علامة koscriptive-complexity - هذه الصفحة 1 - GeneraCodice
How to describe Deterministic Transitive Closure in FOL?
https://www.generacodice.com/ar/articolo/2477691/how-to-describe-deterministic-transitive-closure-in-fol
first-order-logic
-
datalog
-
finite-model-theory
-
descriptive-complexity
cs.stackexchange
How to understand the notion of boolean query via Immerman's definition
https://www.generacodice.com/ar/articolo/1608820/how-to-understand-the-notion-of-boolean-query-via-immerman-s-definition
complexity-theory
-
logic
-
finite-model-theory
-
descriptive-complexity
cs.stackexchange
Why doesn't descriptive complexity theory solve P = NP?
https://www.generacodice.com/ar/articolo/1592080/why-doesn-t-descriptive-complexity-theory-solve-p-np
complexity-theory
-
descriptive-complexity
-
p-vs-np
cs.stackexchange
First Order interpretation of arbitrary structures as a graph
https://www.generacodice.com/ar/articolo/1515681/first-order-interpretation-of-arbitrary-structures-as-a-graph
complexity-theory
-
logic
-
descriptive-complexity
-
graphs
cs.stackexchange
Can a transcendental number like $e$ or $\pi$ be compressed as not algorithmically random?
https://www.generacodice.com/ar/articolo/1511801/can-a-transcendental-number-like-e-or-pi-be-compressed-as-not-algorithmically-random
turing-machines
-
information-theory
-
randomness
-
descriptive-complexity
-
kolmogorov-complexity
cs.stackexchange
About proofs in descriptive complexity
https://www.generacodice.com/ar/articolo/1488739/about-proofs-in-descriptive-complexity
descriptive-complexity
cs.stackexchange
When does the function mapping a string to its prefix-free Kolmogorov complexity halt?
https://www.generacodice.com/ar/articolo/1097398/when-does-the-function-mapping-a-string-to-its-prefix-free-kolmogorov-complexity-halt
terminology
-
computability
-
descriptive-complexity
-
kolmogorov-complexity
cs.stackexchange
Can joins be parallelized?
https://www.generacodice.com/ar/articolo/1096740/can-joins-be-parallelized
complexity-theory
-
time-complexity
-
database-theory
-
parallel-computing
-
descriptive-complexity
cs.stackexchange
«
1
2
3
4
»
العثور على نتائج: 31