Fluorescence interference contrast microscopy - Revision history

91.124.179.74: /* References */

2014-10-25T10:54:10Z

References

← Older revision		Revision as of 12:54, 25 October 2014
Line 1:		Line 1:
	~~In [[computer science]], a '''first-order reduction''~~' is ~~a very weak type of~~ [~~[reduction (complexity)\|reduction~~]~~] between two~~ [~~[computational problem]~~]s ~~in [[computational complexity theory]]~~. ~~A first-order reduction is a reduction where each component is restricted to be in the class~~ [~~[FO (complexity)\|FO~~]~~] of problems calculable in~~ [~~[first-order logic]~~].		Greetings. The author's title is over the counter std test Phebe and she feels comfy when individuals use the complete title. [http://Www.Md-Health.com/Types-Of-Bacteria.html Bookkeeping] is what I do. [http://blog.std-tests-r-us.com/ Minnesota] is where he's been residing for many years. Doing ceramics std [http://premium.asslikethat.com/blog/9567 home std test kit] test is what her family [http://www.buzzbit.net/user/AFilson at home std testing] home std test and her appreciate.<br><br>Here is my web-site; [https://mostlymusiccom.zendesk.com/entries/53427870-Prevent-Candida-Albicans-Before-Hand-With-These-Tips https://mostlymusiccom.zendesk.com/entries/53427870-Prevent-Candida-Albicans-Before-Hand-With-These-Tips]

	~~Since we have~~ <~~math~~>~~\mbox{FO} \subsetneq \mbox{L}~~<~~/math~~>~~, the first~~-~~order reductions are weaker reductions than the~~ [~~[logspace reduction]]s~~.

	~~Many important complexity classes are closed under first~~-~~order reductions, and many of the traditional [[complete (complexity)\|complete]] problems are first~~-~~order complete as well (Immerman 1999 p. 49~~-~~50). For example, [[ST~~-~~connectivity]] is FO~~-~~complete for [[NL (complexity)\|NL]], and [[NL (complexity)\|NL]] is closed under FO reductions (Immerman 1999, p~~. ~~51) (as are [[P (complexity)\|P]], [[NP (complexity)\|NP]], and most other "well~~-~~behaved" classes).~~

	~~==References==~~
	*{{cite book \| last = Immerman \| first = Neil \| authorlink = Neil Immerman \| title = Descriptive Complexity \| year = 1999 \| publisher = Springer-~~Verlag \| location = New York \| isbn = 0~~-~~387~~-~~98600~~-~~6}}~~

	~~[[Category:Descriptive complexity]]~~

	~~{{comp~~-~~sci~~-~~stub}}~~

en>EmausBot: Bot: Migrating 1 interwiki links, now provided by Wikidata on d:Q13587385

2013-07-03T05:09:24Z

Bot: Migrating 1 interwiki links, now provided by Wikidata on d:Q13587385

← Older revision		Revision as of 07:09, 3 July 2013
Line 1:		Line 1:
	~~Hi there. Let me begin by introducing the author~~, ~~her name~~ is ~~Myrtle Cleary~~. ~~One of the issues she enjoys most~~ is ~~to do aerobics and now she~~ is ~~trying~~ to ~~earn money with it~~. ~~For years I've been operating as a payroll clerk. Years ago~~ we ~~moved to North Dakota.~~<br><br>~~Also visit my weblog~~ ... [~~http~~:~~//xrambo.com/blog/191590 std home test~~]		In [[computer science]], a '''first-order reduction''' is a very weak type of [[reduction (complexity)\|reduction]] between two [[computational problem]]s in [[computational complexity theory]]. A first-order reduction is a reduction where each component is restricted to be in the class [[FO (complexity)\|FO]] of problems calculable in [[first-order logic]].

			Since we have <math>\mbox{FO} \subsetneq \mbox{L}</math>, the first-order reductions are weaker reductions than the [[logspace reduction]]s.

			Many important complexity classes are closed under first-order reductions, and many of the traditional [[complete (complexity)\|complete]] problems are first-order complete as well (Immerman 1999 p. 49-50). For example, [[ST-connectivity]] is FO-complete for [[NL (complexity)\|NL]], and [[NL (complexity)\|NL]] is closed under FO reductions (Immerman 1999, p. 51) (as are [[P (complexity)\|P]], [[NP (complexity)\|NP]], and most other "well-behaved" classes).

			==References==
			*{{cite book \| last = Immerman \| first = Neil \| authorlink = Neil Immerman \| title = Descriptive Complexity \| year = 1999 \| publisher = Springer-Verlag \| location = New York \| isbn = 0-387-98600-6}}

			[[Category:Descriptive complexity]]

			{{comp-sci-stub}}

en>ChrisGualtieri: /* Experimental Setup */Typo fixing, typos fixed: , → , using AWB

2012-07-22T14:38:15Z

Experimental Setup: Typo fixing, typos fixed: , → , using AWB

New page

Hi there. Let me begin by introducing the author, her name is Myrtle Cleary. One of the issues she enjoys most is to do aerobics and now she is trying to earn money with it. For years I've been operating as a payroll clerk. Years ago we moved to North Dakota.<br><br>Also visit my weblog ... [http://xrambo.com/blog/191590 std home test]