skip to main content
Lingue:
Primo Advanced Search
Primo Advanced Search Query Term
Primo Advanced Search Query Term
Primo Advanced Search Query Term
Primo Advanced Search prefilters
Mostra solo
Filtrati per: Argomento: Descriptive Complexity Theory rimuovi
Result Number Material Type Add to My Shelf Action Record Details and Options
1
On the expressive power of monadic least fixed point logic
Material Type:
Articolo
Aggiungi allo Scaffale Elettronico

On the expressive power of monadic least fixed point logic

Schweikardt, Nicole

Theoretical computer science, 2006, Vol.350 (2), p.325-344 [Rivista Peer Reviewed]

Fulltext disponibile

2
The Expressive Power of Higher-Order Datalog
Material Type:
Articolo
Aggiungi allo Scaffale Elettronico

The Expressive Power of Higher-Order Datalog

CHARALAMBIDIS, ANGELOS ; NOMIKOS, CHRISTOS ; RONDOGIANNIS, PANOS

Theory and practice of logic programming, 2019-09, Vol.19 (5-6), p.925-940 [Rivista Peer Reviewed]

Fulltext disponibile

3
Succinctness as a source of complexity in logical formalisms
Material Type:
Articolo
Aggiungi allo Scaffale Elettronico

Succinctness as a source of complexity in logical formalisms

Gottlob, Georg ; Leone, Nicola ; Veith, Helmut

Annals of pure and applied logic, 1999, Vol.97 (1), p.231-260 [Rivista Peer Reviewed]

Fulltext disponibile

4
Model-checking problems as a basis for parameterized intractability
Material Type:
Articolo
Aggiungi allo Scaffale Elettronico

Model-checking problems as a basis for parameterized intractability

Flum, Jörg ; Grohe, Martin ; Libkin, Leonid

Logical methods in computer science, 2005-03-07, Vol.1 (1) [Rivista Peer Reviewed]

Fulltext disponibile

5
Randomness in complexity theory and logics
Material Type:
Risorsa testuale
Aggiungi allo Scaffale Elettronico

Randomness in complexity theory and logics

Eickmeyer, Kord

Fulltext disponibile

6
Languages represented by Boolean formulas
Material Type:
Articolo
Aggiungi allo Scaffale Elettronico

Languages represented by Boolean formulas

Veith, Helmut

Information processing letters, 1997, Vol.63 (5), p.251-256 [Rivista Peer Reviewed]

Fulltext disponibile

7
The structure of graphs and new logics for the characterization of Polynomial Time
Material Type:
Risorsa testuale
Aggiungi allo Scaffale Elettronico

The structure of graphs and new logics for the characterization of Polynomial Time

Laubner, Bastian

Fulltext disponibile

8
Hierarchies in classes of program schemes
Material Type:
Articolo
Aggiungi allo Scaffale Elettronico

Hierarchies in classes of program schemes

Arratia-Quesada, A

Journal of logic and computation, 1999-12-01, Vol.9 (6), p.915-957 [Rivista Peer Reviewed]

Fulltext disponibile

9
Enhancing fixed point logic with cardinality quantifiers
Material Type:
Articolo
Aggiungi allo Scaffale Elettronico

Enhancing fixed point logic with cardinality quantifiers

Hella, L

Journal of logic and computation, 1998-02-01, Vol.8 (1), p.71-86 [Rivista Peer Reviewed]

Fulltext disponibile

10
Linear Time Computable Problems and Logical Descriptions
Material Type:
Articolo
Aggiungi allo Scaffale Elettronico

Linear Time Computable Problems and Logical Descriptions

Seese, Detlef

Electronic notes in theoretical computer science, 1995, Vol.2, p.246-259

Fulltext disponibile

Personalizza i tuoi risultati

  1. Edita

Refine Search Results

Espandi i risultati

  1.   

Mostra solo

  1. Riviste Peer-reviewed (7)

Ricerca in corso nelle risorse remote ...