Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Subscribe
Academic
Publications
Descriptive complexity
Descriptive complexity,Neil Immerman
Edit
Descriptive complexity
(
Citations: 344
)
BibTex

RIS

RefWorks
Download
Neil Immerman
Published in 1999.
Cumulative
Annual
Citation Context
(222)
...Another interesting (and related) connection that we plan to explore further in the future is that between the descript ive complexity [
10
] of a template and the size of the smallest set of universally smart inputs...
Patrice Godefroid
,
et al.
Automated synthesis of symbolic instruction encodings from I/O samples
...For further reference, please see the books by Ebbinghaus and Flum
5
and Immerman
14
...
Prabhu Manyem
.
Syntactic expressions to express NPhard optimization problems and pro...
...The relation BIT is a further important relation which is defined by: BIT(a, j) holds iff the bit of order 2 j is 1 in the binary representation bin(a) of a .T he presence of builtin relations is signalled, e.g., by the notation FO(<) .I t is well known that FO(<,+, ×) ≡ FO(<,BIT) (see [
22
])...
...The computational analogue of a firstorder generalized quantifier is the notion of an oracle (see [
22
])...
Juha Kontinen
,
et al.
Characterizing Definability of SecondOrder Generalized Quantifiers
...For background and a precise definition, I refer the reader to one of the textbooks [21, 27,
45
, 49]...
Martin Grohe
.
FixedPoint Definability and Polynomial Time on Chordal Graphs and Lin...
...More useful for us, [
Imm99
] showed that an element of AC 0...
Stephen Cook
,
et al.
Formal Theories for Linear Algebra
Sort by:
Citations
(344)
Natural complexity, computational complexity and depth
(
Citations: 1
)
J. Machta
Journal:
Chaos
, vol. 21, 2011
Automated synthesis of symbolic instruction encodings from I/O samples
Patrice Godefroid
,
Ankur Taly
Journal:
Sigplan Notices  SIGPLAN
, pp. 441452, 2011
Rank Hierarchies for Generalized Quantifiers
H. Jerome Keisler
,
Wafik Boulos Lotfallah
Journal:
Journal of Logic and Computation  LOGCOM
, vol. 21, no. 2, pp. 287306, 2011
Syntactic expressions to express NPhard optimization problems and problems with zero duality gap
Prabhu Manyem
Journal:
Optimization
, vol. aheadofp, no. aheadofp, pp. 120, 2011
The Descriptive Complexity of the Deterministic Exponential Time Hierarchy
Cibele Matos Freire
,
Ana Teresa C. Martins
Journal:
Electronic Notes in Theoretical Computer Science  ENTCS
, vol. 269, pp. 7182, 2011