Misplaced Pages

Pages that link to "Descriptive Complexity"

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.

← Descriptive Complexity

The following pages link to Descriptive Complexity

External tools

(link count
transclusion count
sorted list) · See help page for transcluding these entries

Showing 19 items.

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

P (complexity) (links | edit)
Ehrenfeucht–Fraïssé game (links | edit)
Least fixed point (links | edit)
Neil Immerman (links | edit)
Finite model theory (links | edit)
St-connectivity (links | edit)
Fagin's theorem (links | edit)
AC0 (links | edit)
BIT predicate (links | edit)
Query (complexity) (links | edit)
First-order reduction (links | edit)
Ronald Fagin (links | edit)
Serge Abiteboul (links | edit)
Implicit graph (links | edit)
LH (complexity) (links | edit)
Spectrum of a sentence (links | edit)
Talk:Descriptive Complexity (transclusion) (links | edit)
Misplaced Pages:WikiProject Mathematics/List of mathematics articles (D–F) (links | edit)
Misplaced Pages:WikiProject Mathematics/List of mathematics articles (D) (links | edit)

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)