Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article; zbMATH DE number 1343480

From MaRDI portal
Publication:4267172
Jump to:navigation, search

zbMath0959.68523MaRDI QIDQ4267172

Neil Immerman

Publication date: 6 May 2001


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexitydescriptive complexity


Mathematics Subject Classification ID

Descriptive complexity and finite models (68Q19)


Related Items

Unnamed Item, On the complexity of inverse semigroup conjugacy, Unnamed Item, Unnamed Item, Unnamed Item, The equational complexity of Lyndon's algebra, The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis, From a zoo to a zoology: Towards a general theory of graph polynomials, Ehrenfeucht-Fraïssé Games on Random Structures, Counting of Teams in First-Order Team Logics



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4267172&oldid=18175314"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 6 February 2024, at 18:26.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki