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.
2017
2017
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… 
Highly Cited
2014
Highly Cited
2014
Environmental context The effects of engineered nanoparticles on the environment and on human health are difficult to evaluate… 
2012
2012
This paper explores the perceptions of the impact that volunteer tourism has on the conservation awareness of non-volunteer… 
2011
2011
We present the performance measures of our Java Cryptography Architecture (JCA) implementation that integrates sanitizable… 
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… 
Highly Cited
2005
Highly Cited
2005
For almost a decade, the Euro-Mediterranean Partnership (EMP) has been the main venue for the EU's relations to its southern… 
Highly Cited
1996
Highly Cited
1996
Ecosystem metabolism was measured from die1 changes in free-water dissolved oxygen in 3 shallow subestuanes of Waquoit Bay on…