
	Where results make sense

Topic: NL (complexity)

Related Topics

complex number

computational complexity theory

complex analysis

complexity theory

complex plane

Complexity classes P and NP

complexity class

complex conjugate

complex systems

military industrial complex

complex manifold

NP complexity

In the News (Thu 24 Dec 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	NL (complexity) - Wikipedia, the free encyclopedia
		NL is the complexity class containing decision problems which can be solved by a nondeterministic Turing machine using a logarithmic amount of memory space.
		NL is a generalization of L, the class for logspace problems on a deterministic Turing machine.
		Suppose C is the complexity class of problems solvable in logarithmithic space with probabilistic Turing machines that never accept incorrectly but are allowed to reject incorrectly less than 1/3 of the time; this is called one-sided error.
	en.wikipedia.org /wiki/NL_(complexity) (949 words)

	Dieter van Melkebeek - Research on Computational Complexity Theory
		Torenvliet established that large complexity classes like doubly exponential space have complete languages that are not autoreducible, whereas the complete languages of smaller classes like exponential time all share the property of autoreducibility.
		The consensus within the complexity community suggests a positive answer, although an inherent exponential slowdown is not yet ruled out (the BPP versus EXP problem).
		The Kolmogorov complexity of a string is the length of its shortest description; various complexity restrictions on the descriptions lead to various notions of Kolmogorov complexity.
	www.cs.wisc.edu /~dieter/Research/complexity.html (2966 words)

	308-506 Notes for 29 Nov 2001
		We look at complexity classes sitting within P, namely the space-bounded classes L and NL, show that st-PATH is NL-complete and prove that NL is equal to co-NL.
		The space complexity S(n) of an offline TM is the maximum number of distinct work tape cells accessed by the machine on an input of length n.
		One interesting consequence of the NL-completeness of st-PATH is that NL is contained in P. Also, note that that proof can be adapted to show that Degree-1-st-PATH (reachability in a directed graph of outdegree 1) is complete for L. It is widely believed that L is not equal to NL.
	www.cs.mcgill.ca /~barring/notes/20.htm (1315 words)

	Complexity Theory: A Modern Approach / Sanjeev Arora and Boaz Barak
		This is a draft of a textbook on computational complexity theory that we expect to publish in Aug 2007 (hence, submit to the publisher by
		It is intended as a text for an advanced undergraduate course or introductory graduate course, or as a reference for researchers and students in computer science and allied fields such as mathematics and physics.
		Complexity of Counting #P. #P-completeness and Valiant's theorem.
	www.cs.princeton.edu /theory/complexity (481 words)

	LINGUIST List 9.1009: Complexity in language
		Especially in creole studies simplicity and complexity implicitly have been dominant issues in the debate, but are seldom properly scrutinized.
		All complexity in languages resides in the lexicon.
		Complexity does not play a role in first language acquisition, but it does in second language acquisition.
	www.linguistlist.org /issues/9/9-1009.html (510 words)

	Complexity Theory Lecture Notes (summaries)
		We define ``nice'' complexity bounds; these are bounds which can be computed within the resources they supposedly bound (e.g., we focus on time-constructible and space-constructible bounds).
		We define space complexity using an adequate model of computation in which one is not allowed to use the area occupied by the input for computation.
		Then we study the complexity class NL (the set of languages decidable within Non-Deterministic Logarithmic Space): We show that directed graph connectivity is complete for NL.
	www.wisdom.weizmann.ac.il /~oded/cc-sum.html (2076 words)

	[No title]
		For example, a sequence such as 00000000000000000000000000000000 can be described by a short program such as for i=1,30 print 0 while a sequence with no pattern can only be described by itself (or some equally long sequence), e.g.
		P vs NP Historical Context If one goes back a couple of hundred years, we can see that the historical motivation for the study of complexity of algorithms is the desire to identify, under a formal framework, those problems that can be solved "fast".
		Complexity Theory (a) Lower Bounds (b) YACC (Yet Another Complexity Class) 9.
	archive.cs.uu.nl /pub/NEWS.ANSWERS/theory-faq (3344 words)

	A Lower Bound on the Average-Case Complexity of Shellsort - Jiang, Li, Vit'anyi (ResearchIndex) (Site not responding. Last check: 2007-11-07)
		Abstract: We give a general lower bound on the average-case complexity of Shellsort: the average number of data-movements (and comparisons) made by a p-pass Shellsort for any incremental sequence is \Omega\Gamma pn 1+1=p) for every p.
		The proof is an example of the use of Kolmogorov complexity (the incompressibility method) in the analysis of algorithms.
		Jiang, M. Li, P. Vit'anyi, A lower bound on the average-case complexity of Shellsort.
	citeseer.ist.psu.edu /jiang99lower.html (556 words)

	[No title]
		An issue that I have been dealing with is how subjectivity and complexity may be related.
		It seems to me that the notion of 'subject' may become redefined due to insights from biological complexity, esp. those of Rosen and Pattee.
		Pattee puts it in terms of complementary descriptions that are required, and that cannot be combined into one encompassing description.
	www.vcu.edu /complex/discussion/0724_1430.txt (1042 words)

	CS810: Introduction to Complexity Theory (Models and Formalisms of Computation)
		Lecture 1 (ps) (pdf) Overview of Complexity Theory; Diagonalization by Cantor and Turing.
		In the major segment of the class we will try to give a more accurate taste of the modern flavor of the subject, where the focus is on more concrete complexity problems as versus abstract complexity measures, and where randomness and interaction play a more important role.
		Further topics include an introduction to circuit complexity theory, constant depth circuit lower bound, Mod p gates, Barrington's theorem on constant width branching program, Nisan's generator for space bounded computation and graph connectivity, the complexity of Unique SAT, and Toda's Theorem.
	www.cs.wisc.edu /~jyc/cs810.html (773 words)

	Average Case Complexity under the Universal Distribution Equals Worst Case Complexity - Li, anyi (ResearchIndex) (Site not responding. Last check: 2007-11-07)
		Abstract: The average complexity of any algorithm whatsoever (provided it always terminates) under the universal distribution is of the same order of magnitude as the worst-case complexity.
		65 The complexity of finite objects and development of the conc..
		1 The complexity of malign ensembles (context) - Milterson - 1990
	citeseer.ist.psu.edu /li92average.html (474 words)

	[No title]
		Kolmogorov complexity is a modern notion of randomness dealing with the quantity of information in individual objects; that is, pointwise randomness rather than average randomness as produced by a random source.
		The Kolmogorov complexity of an object is a form of absolute information of the individual object.
		`Kolmogorov' complexity was earlier proposed by Ray Solomonoff in a Zator Technical Report in 1960 and in a long paper in Information and Control in 1964.
	homepages.cwi.nl /~paulv/kolmogorov.html (824 words)

	Complexity Zoo - Qwiki
		Roughly, the analogue of #P for parameterized complexity.
		In descriptive complexity, uniform AC can be characterized as the class of problems expressible by first-order predicates with addition and multiplication operators - or indeed, with ordering and multiplication, or ordering and division (see [Lee02]).
		Finding a maximum flow, which is P-complete, can be done in CP Based on this the authors argue that "P is contained in CP," but this seems hard to formalize, since CP is not a complexity class in the usual sense.
	qwiki.caltech.edu /wiki/Complexity_Zoo (6771 words)

	ECCC Report TR03-075 and related Papers (Site not responding. Last check: 2007-11-07)
		The minimum number of bits that must be communicated is the deterministic communication complexity of $f$.
		This complexity measure was introduced by Yao cite{1} to focus attention on the cost of information transfer associated with a given distributed computation.
		Then we discuss the communication complexity of specific functions and some of the many applications that the theory of communication complexity has.
	eccc.hpi-web.de /eccc-reports/2003/TR03-075 (195 words)

	Complexity Reduction of the Context-Tree Weighting Method - Willems, Tjalkens (ResearchIndex) (Site not responding. Last check: 2007-11-07)
		If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
		Abstract: We present a method to decrease the storage and communication complexity of the context-tree weighting method.
		This method is based on combining the estimated probability of a node in the context tree and weighted probabilities of its children in one single variable.
	citeseer.ist.psu.edu /willems97complexity.html (474 words)

	nl - OneLook Dictionary Search
		NL, n.l : Encarta® World English Dictionary, North American Edition [home, info]
		NL : DOD Dictionary of Military Terms: Joint Acronyms and Abbreviations [home, info]
		Phrases that include nl: d to nl, list of nl division series broadcasters, list of nl gold glove winners at pitcher, nl bea, nl complete, more...
	www.onelook.com /cgi-bin/cgiwrap/bware/dofind.cgi?word=nl (190 words)

	[No title]
		Proof complexity and feasible arithmetics are closely related to each other and to fundamental problems from circuit complexity and computational complexity, such as the NP versus coNP problem.
		One example is the application of methods from circuit complexity lower bound proofs to obtain new lower bounds on proof complexity.
		Another example is the recent work on natural proofs, which has shown that if certain theories of bounded arithmetic can prove lower bounds in complexity theory, then certain levels of cryptographic security cannot be achieved.
	ai.stanford.edu /~suresh/theory/conf/pro-DIMACS-960421.txt (622 words)

	NL - Wikipedia, the free encyclopedia
		Soviet Union, Finnish abbreviation NL for Neuvostoliitto (Soviet Union)
		NL, an abbreviation of Nomen loci (Latin for place-name) See Toponymy.
		If an article link referred you to this page, you may wish to change the link to point directly to the intended article.
	en.wikipedia.org /wiki/NL (105 words)

	(WO/2002/051161) FRAME-TYPE DEPENDENT REDUCED COMPLEXITY VIDEO DECODING (Site not responding. Last check: 2007-11-07)
		KONINKLIJKE PHILIPS ELECTRONICS N.V. [NL/NL]; Groenewoudseweg 1 NL-5621 BA Eindhoven (NL).
		LANDOUSY, Christian; Internationaal Octrooibureau B.V. Prof Holstlaan 6 NL-5656 AA Eindhoven (NL).
		The present invention is directed to frame-type dependent (FTD) processing in which a different type of processing (including scaling) is performed according to the types (I, B, or P) of pictures or frames being processed.
	www.wipo.int /pctdb/en/wo.jsp?KEY=02/51161.020627 (204 words)

	Computational Complexity
		מבחן cc04b-a שאלה 1 (על NL ורכיבי קשירות חזקה).
		Hint for 6: start with showing that SAT is in NL*.
		and for complexity class separation - The Time and space hierarchies.
	www.cs.tau.ac.il /~odedsc/cc06b/cc06b.html (713 words)

	[No title]
		Subject: Computational Complexity 98, Call for papers To: DMA-LIST@NIC.SURFNET.NL Status: O X-Status: Below is an ASCII version of the call for papers for Computational Complexity 98.
		To submit a paper through regular channels, send ten copies of an extended abstract to the program committee chair: Joan Feigenbaum, Email: jf@research.att.com AT&T Labs - Research Phone: 973 360 8442 Room C203 180 Park Avenue Florham Park, NJ 07932, USA A submission must be received by December 5th, 1997 for consideration.
		FOR MORE INFORMATION Get more information through the complexity web page: http://cs.utep.edu/longpre/complexity.html You may also contact the publicity chair: Luc Longpr\'{e}; Computer Science Department, University of Texas at El Paso, El Paso, TX 79968, USA; E-mail: longpre@cs.utep.edu.
	ai.stanford.edu /~suresh/theory/conf/cfp-CC-971205.txt (616 words)

Try your search on: Qwika (all wikis)