On the public citation graph

Descriptive Complexity of Some Fair Division Problems

0 signed · 10 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4612-0539-5openalex-extracted
Descriptive Complexity
inferredcites →https://doi.org/10.1007/978-3-642-04428-1_9openalex-extracted
On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences
inferredcites →https://doi.org/10.1017/cbo9780511804090openalex-extracted
Computational Complexity
inferredcites →https://doi.org/10.1093/jigpal/jzz009openalex-extracted
Universal first-order logic is superfluous in the second level of the polynomial-time hierarchy
inferredcites →https://doi.org/10.2168/lmcs-10(1:15)2014openalex-extracted
Universal First-Order Logic is Superfluous for NL, P, NP and coNP
inferredcites →https://doi.org/10.2307/2273858openalex-extracted
Classifying the computational complexity of problems
inferredcites →https://doi.org/10.4204/eptcs.297.8openalex-extracted
Reasoning about Social Choice and Games in Monadic Fixed-Point Logic
inferredcites →https://doi.org/10.7275/54695openalex-extracted
A Descriptive Approach to the Class NP
inferredcites →https://doi.org/10.1007/3-540-28788-4openalex-snapshot
Finite Model Theory
inferredcites →https://doi.org/10.1613/jair.2467openalex-snapshot
Efficiency and Envy-freeness in Fair Division of Indivisible Goods: Logical Representation and Complexity
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.