Skip to search formSkip to main contentSkip to account menu

E (complexity)

Known as: E (disambiguation) 
In computational complexity theory, the complexity class E is the set of decision problems that can be solved by a deterministic Turing machine in… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
We prove that if every problem in NP has nk-size circuits for a fixed constant k, then for every NP-verifier and every yes… 
Highly Cited
2016
Highly Cited
2016
Radiation patterns and the resonance wavelength of a plasmonic antenna are significantly influenced by its local environment… 
2012
2012
This paper explores the perceptions of the impact that volunteer tourism has on the conservation awareness of non-volunteer… 
2012
2012
Background: Cowpea is a highly inbred crop. It is part of a crop-weed complex, whose origin and dynamics is unknown, which is… 
Highly Cited
2011
Highly Cited
2011
Time-based localization approaches attract a lot of interest due to their high accuracy and potentially low cost for wireless… 
Highly Cited
2010
Highly Cited
2010
In this paper, we present results dealing with the non-uniform pollution carried out under 50 Hz applied voltage on a plane model… 
2006
2006
Despite varying levels of political pluralism, democracy is not at home in either of the secessionist entities of Transnistria…