Counting Proportions of Sets: Expressive Power with Almost Order

From MaRDI portal

Revision as of 00:03, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3525752

Jump to:navigation, search

DOI10.1007/11682462_14zbMath1145.68431OpenAlexW1506160289MaRDI QIDQ3525752

Carlos E. P. Ortiz, Argimiro A. Arratia

Publication date: 18 September 2008

Published in: LATIN 2006: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11682462_14

zbMATH Keywords

computational complexity expressiveness NL P proportional quantifiers almost order

Mathematics Subject Classification ID

Logic with extra quantifiers and operators (03C80) Model theory of finite structures (03C13) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Combinatorial games (91A46) Descriptive complexity and finite models (68Q19)

This page was built for publication: Counting Proportions of Sets: Expressive Power with Almost Order

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3525752&oldid=16894693"