Lower bounds for invariant queries in logics with counting. (Q1853505): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: DBLP publication ID (P1635): journals/tcs/LibkinW02, #quickstatements; #temporary_batch_1731475607626
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Leonid O. Libkin / rank
Normal rank
 
Property / author
 
Property / author: Leonid O. Libkin / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q61910885 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniformity within \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4362726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal lower bound on the number of variables for graph identification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local properties of query languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting quantifiers, successor relations, and logarithmic space / rank
 
Normal rank
Property / cites work
 
Property / cites work: On monadic NP vs monadic co-NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3666827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218118 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical hierarchies in PTIME / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notions of locality and their logical characterizations over finite models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logics with aggregate operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relational queries computable in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Languages that Capture Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized quantifiers and pebble games on finite structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinitary logics and 0-1 laws / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query languages for bags and aggregate functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4381388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On winning strategies with unary quantifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4332930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Epsilon-logic is more expressive than first-order logic over finite structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel computation with threshold functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Natural proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Connectivity, Monadic NP and built-in relations of moderate degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On winning Ehrenfeucht games and monadic NP / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0304-3975(01)00152-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2063991224 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/tcs/LibkinW02 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:50, 13 November 2024

scientific article
Language Label Description Also known as
English
Lower bounds for invariant queries in logics with counting.
scientific article

    Statements

    Lower bounds for invariant queries in logics with counting. (English)
    0 references
    0 references
    0 references
    21 January 2003
    0 references
    complexity classes
    0 references
    descriptive complexity
    0 references
    expressive power
    0 references
    counting logics
    0 references
    first-order logic with counting
    0 references

    Identifiers