On the public citation graph

Evasiveness of Graph Properties and Topological Fixed-Point Theorems

0 signed · 29 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/3-540-45726-7_9openalex-snapshot
Computing Graph Properties by Randomized Subcube Partitions
inferredcites →https://doi.org/10.1007/978-3-540-71962-5openalex-snapshot
Combinatorial Algebraic Topology
inferredcites →https://doi.org/10.1007/bf01375470openalex-snapshot
An ?(n 5/4) lower bound on the randomized complexity of graph properties
inferredcites →https://doi.org/10.1007/bf01706081openalex-snapshot
On the time required to detect cycles and connectivity in graphs
inferredcites →https://doi.org/10.1007/bf01844851openalex-snapshot
On the recognition complexity of some graph properties
inferredcites →https://doi.org/10.1007/bf02122695openalex-snapshot
A lower bound for the recognition of digraph properties
inferredcites →https://doi.org/10.1007/bf02565743openalex-snapshot
Fixed-point sets of group actions on finite acyclic complexes
inferredcites →https://doi.org/10.1007/bf02579140openalex-snapshot
A topological approach to evasiveness
inferredcites →https://doi.org/10.1007/s00493-010-2485-3openalex-snapshot
An asymptotic bound for the complexity of monotone graph properties
inferredcites →https://doi.org/10.1016/0022-0000(91)90003-nopenalex-snapshot
Lower bounds to randomized algorithms for graph properties
inferredcites →https://doi.org/10.1016/0095-8956(80)90057-xopenalex-snapshot
Further results on the Aanderaa-Rosenberg conjecture
inferredcites →https://doi.org/10.1016/0304-3975(76)90053-0openalex-snapshot
On recognizing graph properties from adjacency matrices
inferredcites →https://doi.org/10.1016/s0012-365x(99)00049-7openalex-snapshot
Constructions preserving evasiveness and collapsibility
inferredcites →https://doi.org/10.1080/00029890.1997.11990704openalex-snapshot
Newman's Short Proof of the Prime Number Theorem
inferredcites →https://doi.org/10.1109/ccc.2004.14openalex-snapshot
Graph properties and circular functions: how low can quantum query complexity go?
inferredcites →https://doi.org/10.1137/0217031openalex-snapshot
Monotone Bipartite Graph Properties are Evasive
inferredcites →https://doi.org/10.1145/800119.803888openalex-snapshot
Determining graph properties from matrix representations
inferredcites →https://doi.org/10.2307/2371271openalex-snapshot
Fixed-Point Theorems for Periodic Transformations
inferredcites →https://doi.org/10.48550/arxiv.cs/0205031openalex-snapshot
Lecture Notes on Evasiveness of Graph Properties

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/jgt.22419openalex-snapshot
The evasiveness conjecture and graphs on vertices
inferred← citeshttps://doi.org/10.1007/978-3-319-44479-6_10openalex-snapshot
Using Brouwer’s Fixed Point Theorem
inferred← citeshttps://doi.org/10.1007/978-3-319-53007-9_22openalex-snapshot
Elusiveness of Finding Degrees
inferred← citeshttps://doi.org/10.1007/s00453-020-00676-9openalex-snapshot
Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness
inferred← citeshttps://doi.org/10.1007/s00453-021-00894-9openalex-snapshot
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness
inferred← citeshttps://doi.org/10.1016/j.dam.2019.06.009openalex-snapshot
Elusiveness of finding degrees
inferred← citeshttps://doi.org/10.1137/20m1365624openalex-snapshot
Counting Small Induced Subgraphs Satisfying Monotone Properties
inferred← citeshttps://doi.org/10.1145/3651614openalex-snapshot
Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity
inferred← citeshttps://doi.org/10.1145/3771726openalex-snapshot
Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity
inferred← citeshttps://doi.org/10.48550/arxiv.1603.04412openalex-snapshot
The Evasiveness Conjecture and Graphs on 2p Vertices
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.