Skip to search formSkip to main contentSkip to account menu

NE (complexity)

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
--------------------------------------------------------------------ABSTRACT… 
2008
2008
Word sense disambiguation (WSD) methods evolve towards exploring all of the available semantic information that word thesauri… 
2008
2008
In this paper, we propose a new framework for quantum field theory in terms of consistency conditions. The consistency conditions… 
2008
2008
The main objective of this work was to understand fundamental processes related to incipient continental collision through… 
2007
2007
水分非平衡状態における木材の微細構造について知見を得るため,アカマツ切片に対して,湿度変化過程におけるin situでのX線回折および示差走査熱量(DSC)の同時測定,および熱重量(TG… 
2005
2005
1. Abstract Most of the approaches found in literature dealing with topology design sequences are based on sensitivity… 
1996
1996
Various search directions used in interior-point-algorithms for the SDP (semidefinite program) and the monotone SDLCP (semide… 
1995
1995
Multivariate polyhedral splines can be used to solve a common image synthesis problem: multivariate integrals defined over… 
1991
1991
Kwethluk is a community located near the Kuskokwim River in western Alaska, 20 river miles upstream from Bethel. In 1986, the… 
1987
1987
Results are presented that demonstrate the learning and ne-tuning of search strategies using connectionist mechanisms. Previous…