Lower bounds and the hardness of counting properties
Copyright policy )Lower bounds and the hardness of counting properties
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- University of Rochester United States
Complexity of computation (including implicit computational complexity), Counting properties, UP, Relativization, Rice's Theorem, Lower bounds, NP, Theoretical Computer Science, Circuits, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Complexity classes (hierarchies, relations among complexity classes, etc.), Language properties, Computer Science(all)
Complexity of computation (including implicit computational complexity), Counting properties, UP, Relativization, Rice's Theorem, Lower bounds, NP, Theoretical Computer Science, Circuits, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Complexity classes (hierarchies, relations among complexity classes, etc.), Language properties, Computer Science(all)
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!