DSPACE: Difference between revisions
scaling space |
en>Addbot m Bot: Migrating 4 interwiki links, now provided by Wikidata on d:q1155722 (Report Errors) |
||
| Line 1: | Line 1: | ||
In [[computational complexity theory]], '''P''', also known as '''PTIME''' or '''[[DTIME]]'''(''n''<sup>O(1)</sup>), is one of the most fundamental [[complexity class]]es. It contains all [[decision problem]]s that can be solved by a [[deterministic Turing machine]] using a [[polynomial]] amount of [[computation time]], or [[polynomial time]]. | |||
[[Cobham's thesis]] holds that '''P''' is the class of computational problems that are "efficiently solvable" or "tractable"; in practice, some problems not known to be in '''P''' have practical solutions, and some that are in '''P''' do not, but this is a useful rule of thumb. | |||
==Definition== | |||
A language ''L'' is in '''P''' if and only if there exists a deterministic Turing machine ''M'', such that | |||
* ''M'' runs for polynomial time on all inputs | |||
* For all ''x'' in ''L'', ''M'' outputs 1 | |||
* For all ''x'' not in ''L'', ''M'' outputs 0 | |||
'''P''' can also be viewed as a uniform family of [[boolean circuit]]s. A language ''L'' is in '''P''' if and only if there exists a [[Circuit complexity#Polynomial-time uniform|polynomial-time uniform]] family of boolean circuits <math>\{C_n:n \in \mathbb{N}\}</math>, such that | |||
* For all <math>n \in \mathbb{N}</math>, <math>C_n</math> takes ''n'' bits as input and outputs 1 bit | |||
* For all ''x'' in ''L'', <math>C_{|x|}(x)=1</math> | |||
* For all ''x'' not in ''L'', <math>C_{|x|}(x)=0</math> | |||
The circuit definition can be weakened to use only a [[Circuit complexity#Logspace uniform|logspace uniform]] family without changing the complexity class. | |||
== Notable problems in P == | |||
'''P''' is known to contain many natural problems, including the decision versions of [[linear programming]], calculating the [[greatest common divisor]], and finding a [[maximum matching]]. In 2002, it was shown that the problem of determining if a number is [[prime number|prime]] is in '''P'''.<ref>Manindra Agrawal, Neeraj Kayal, Nitin Saxena, "[http://www.cse.iitk.ac.in/users/manindra/algebra/primality_v6.pdf PRIMES is in P]", ''Annals of Mathematics'' 160 (2004), no. 2, pp. 781–793.</ref> The related class of [[function problem]]s is '''[[FP (complexity)|FP]]'''. | |||
Several natural problems are complete for '''P''', including [[st-connectivity|''st''-connectivity]] (or [[reachability]]) on alternating graphs.<ref name="Immerman Reachability">{{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}}</ref> The article on [[P-complete|'''P'''-complete problems]] lists further relevant problems in '''P'''. | |||
== Relationships to other classes == | |||
A generalization of '''P''' is '''[[NP (complexity)|NP]]''', which is the class of [[decision problem]]s decidable by a [[non-deterministic Turing machine]] that runs in [[polynomial time]]. Equivalently, it is the class of decision problems where each "yes" instance has a polynomial size certificate, and certificates can be checked by a polynomial time deterministic Turing machine. The class of problems for which this is true for the "no" instances is called '''[[co-NP]]'''. '''P''' is trivially a subset of '''NP''' and of '''co-NP'''; most experts believe it is a strict subset,<ref>Johnsonbaugh, Richard; Schaefer, Marcus, ''Algorithms'', 2004 Pearson Education, page 458, ISBN 0-02-360692-4</ref> although this (the [[P = NP problem|'''P''' ≠ '''NP''' hypothesis]]) remains unproven. Another open problem is whether '''NP''' = '''co-NP''' (a negative answer would imply '''P''' ≠ '''NP'''). | |||
'''P''' is also known to be at least as large as '''[[L (complexity)|L]]''', the class of problems decidable in a [[logarithm]]ic amount of [[memory space]]. A decider using <math>O(\log n)</math> space cannot use more than <math>2^{O(\log n)} = n^{O(1)}</math> time, because this is the total number of possible configurations; thus, '''L''' is a subset of '''P'''. Another important problem is whether '''L''' = '''P'''. We do know that '''P''' = '''AL''', the set of problems solvable in logarithmic memory by [[alternating Turing machine]]s. '''P''' is also known to be no larger than '''[[PSPACE]]''', the class of problems decidable in polynomial space. Again, whether '''P''' = '''PSPACE''' is an open problem. To summarize: | |||
:<math>\mbox{L} \subseteq \mbox{AL} = \mbox{P} \subseteq \mbox{NP} \subseteq \mbox{PSPACE} \subseteq \mbox{EXPTIME}.</math> | |||
Here, '''[[EXPTIME]]''' is the class of problems solvable in exponential time. Of all the classes shown above, only two strict containments are known: | |||
* '''P''' is strictly contained in '''EXPTIME'''. Consequently, all '''EXPTIME'''-hard problems lie outside '''P''', and at least one of the containments to the right of '''P''' above is strict (in fact, it is widely believed that all three are strict). | |||
* '''L''' is strictly contained in '''PSPACE'''. | |||
The most difficult problems in P are [[P-complete]] problems. | |||
Another generalization of '''P''' is '''P/poly''', or '''Nonuniform Polynomial-Time'''. If a problem is in '''P/poly''', then it can be solved in deterministic polynomial time provided that an [[advice (complexity)|advice string]] is given that depends only on the length of the input. Unlike for '''NP''', however, the polynomial-time machine doesn't need to detect fraudulent advice strings; it is not a verifier. '''P/poly''' is a large class containing nearly all practical problems, including all of '''[[Bounded-error probabilistic polynomial|BPP]]'''. If it contains '''NP''', then the [[polynomial hierarchy]] collapses to the second level. On the other hand, it also contains some impractical problems, including some [[undecidable problem]]s such as the unary version of any undecidable problem. | |||
In 1999, Jin-Yi Cai and D. Sivakumar, building on work by [[Mitsunori Ogihara]], showed that if there exists a [[sparse language]] that is '''P-complete''', then '''L''' = '''P'''.<ref>Jin-Yi Cai and D. Sivakumar. Sparse hard sets for P: resolution of a conjecture of Hartmanis. ''Journal of Computer and System Sciences'', volume 58, issue 2, pp.280–296. 1999. ISSN:0022-0000. [http://citeseer.ist.psu.edu/501645.html At Citeseer]</ref> | |||
== Properties == | |||
Polynomial-time algorithms are closed under composition. Intuitively, this says that if one writes a function that is polynomial-time assuming that function calls are constant-time, and if those called functions themselves require polynomial time, then the entire algorithm takes polynomial time. One consequence of this is that '''P''' is [[low (complexity)|low]] for itself. This is also one of the main reasons that '''P''' is considered to be a machine-independent class; any machine "feature", such as [[random access]], that can be simulated in polynomial time can simply be composed with the main polynomial-time algorithm to reduce it to a polynomial-time algorithm on a more basic machine. | |||
Languages in '''P''' are also closed under reversal, [[Intersection (set theory)|intersection]], [[Union (set theory)|union]], [[Kleene closure]], inverse [[homomorphism]], and [[Complement (complexity)|complementation]].<ref>{{cite book|last=Hopcroft|first=John E.|title=Introduction to automata theory, languages, and computation|year=2001|publisher=Addison-Wesley|location=Boston|isbn=0201441241|pages=425–426|edition=2. ed.|coauthors=Rajeev Motwani, Jeffrey D. Ullman}}</ref> | |||
== Pure existence proofs of polynomial-time algorithms == | |||
Some problems are known to be solvable in polynomial-time, but no concrete algorithm is known for solving them. For example, the [[Robertson–Seymour theorem]] guarantees that there is a finite list of [[forbidden minor]]s that characterizes (for example) the set of graphs that can be embedded on a torus; moreover, Robertson and Seymour showed that there is an O(''n''<sup>3</sup>) algorithm for determining whether a graph has a given graph as a minor. This yields a [[nonconstructive proof]] that there is a polynomial-time algorithm for determining if a given graph can be embedded on a torus, despite the fact that no concrete algorithm is known for this problem. | |||
== Alternative characterizations == | |||
In [[descriptive complexity]], '''P''' can be described as the problems expressible in [[FO(LFP)]], the [[first-order logic]] with a [[least fixed point]] operator added to it, on ordered structures. In Immerman's 1999 textbook on descriptive complexity,<ref>{{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 | page = 66}}</ref> Immerman ascribes this result to Vardi<ref>{{cite conference | last = Vardi | first = Moshe Y. | title = The Complexity of Relational Query Languages | booktitle = STOC '82: Proceedings of the fourteenth annual ACM symposium on Theory of computing | year = 1982 | pages = 137–146 | doi = 10.1145/800070.802186}}</ref> and to Immerman.<ref>{{cite conference | last = Immerman | first = Neil | title = Relational Queries Computable in Polynomial Time | booktitle = STOC '82: Proceedings of the fourteenth annual ACM symposium on Theory of computing | year = 1982 | pages = 147–152 | doi = 10.1145/800070.802187}} Revised version in ''Information and Control'', 68 (1986), 86–104.</ref> | |||
== History == | |||
[[Dexter Kozen|Kozen]]<ref>{{cite book | last = Kozen | first = Dexter C. | year = 2006 | title = Theory of Computation | publisher = Springer | isbn = 1-84628-297-7 | page = 4}}</ref> states that [[Alan Cobham (mathematician)|Cobham]] and [[Jack Edmonds|Edmonds]] are "generally credited with the invention of the notion of polynomial time." Cobham invented the class as a robust way of characterizing efficient algorithms, leading to [[Cobham's thesis]]. However, [[Henry Cabourn Pocklington|H. C. Pocklington]], in a 1910 paper,<ref>{{cite journal | last = Pocklington | first = H. C. | year = 1910–2 | title = The determination of the exponent to which a number belongs, the practical solution of certain congruences, and the law of quadratic reciprocity | journal = Proc. Cambridge Phil. Soc. | volume = 16 | pages = 1–5}}</ref><ref>{{Cite book | last=Gautschi | first=Walter | authorlink=Walter Gautschi | coauthors= | title=Mathematics of computation, 1943–1993: a half-century of computational mathematics: Mathematics of Computation 50th Anniversary Symposium, August 9–13, 1993, Vancouver, British Columbia | year=1994 | publisher=American Mathematical Society | location=Providence, RI | isbn=0-8218-0291-7 | pages=503–504}}</ref> analyzed two algorithms for solving quadratic congruences, and observed that one took time "proportional to a power of the logarithm of the modulus" and contrasted this with one that took time proportional "to the modulus itself or its square root", thus explicitly drawing a distinction between an algorithm that ran in polynomial time versus one that did not. | |||
==Notes== | |||
{{reflist}} | |||
==References== | |||
* {{Cite book | last=Cobham | first=Alan | authorlink=Alan Cobham | year = 1965 | chapter = The intrinsic computational difficulty of functions | title = Proc. Logic, Methodology, and Philosophy of Science II | publisher = North Holland}} | |||
* [[Thomas H. Cormen]], [[Charles E. Leiserson]], [[Ronald L. Rivest]], and [[Clifford Stein]]. ''[[Introduction to Algorithms]]'', Second Edition. MIT Press and McGraw–Hill, 2001. ISBN 0-262-03293-7. Section 34.1: Polynomial time, pp. 971–979. | |||
* {{Cite book | last=Papadimitriou | first=Christos H. | authorlink=Christos H. Papadimitriou | coauthors= | title=Computational complexity | year=1994 | publisher=Addison–Wesley | location=Reading, Mass. | isbn=0-201-53082-1 | pages=}} | |||
* {{Cite book | last=Sipser | first=Michael | authorlink=Michael Sipser | coauthors= | title=Introduction to the Theory of Computation, 2nd Edition | year=2006 | publisher=Course Technology Inc | location= | isbn=0-534-95097-3 | pages=}} Section 7.2: The Class P, pp. 256–263;. | |||
==External links== | |||
* {{CZoo|Class P|P#p}} | |||
* {{CZoo|Class P/poly|P#ppoly}} | |||
{{ComplexityClasses}} | |||
[[Category:Complexity classes]] | |||
Revision as of 10:30, 28 February 2013
In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is one of the most fundamental complexity classes. It contains all decision problems that can be solved by a deterministic Turing machine using a polynomial amount of computation time, or polynomial time.
Cobham's thesis holds that P is the class of computational problems that are "efficiently solvable" or "tractable"; in practice, some problems not known to be in P have practical solutions, and some that are in P do not, but this is a useful rule of thumb.
Definition
A language L is in P if and only if there exists a deterministic Turing machine M, such that
- M runs for polynomial time on all inputs
- For all x in L, M outputs 1
- For all x not in L, M outputs 0
P can also be viewed as a uniform family of boolean circuits. A language L is in P if and only if there exists a polynomial-time uniform family of boolean circuits , such that
- For all , takes n bits as input and outputs 1 bit
- For all x in L,
- For all x not in L,
The circuit definition can be weakened to use only a logspace uniform family without changing the complexity class.
Notable problems in P
P is known to contain many natural problems, including the decision versions of linear programming, calculating the greatest common divisor, and finding a maximum matching. In 2002, it was shown that the problem of determining if a number is prime is in P.[1] The related class of function problems is FP.
Several natural problems are complete for P, including st-connectivity (or reachability) on alternating graphs.[2] The article on P-complete problems lists further relevant problems in P.
Relationships to other classes
A generalization of P is NP, which is the class of decision problems decidable by a non-deterministic Turing machine that runs in polynomial time. Equivalently, it is the class of decision problems where each "yes" instance has a polynomial size certificate, and certificates can be checked by a polynomial time deterministic Turing machine. The class of problems for which this is true for the "no" instances is called co-NP. P is trivially a subset of NP and of co-NP; most experts believe it is a strict subset,[3] although this (the P ≠ NP hypothesis) remains unproven. Another open problem is whether NP = co-NP (a negative answer would imply P ≠ NP).
P is also known to be at least as large as L, the class of problems decidable in a logarithmic amount of memory space. A decider using space cannot use more than time, because this is the total number of possible configurations; thus, L is a subset of P. Another important problem is whether L = P. We do know that P = AL, the set of problems solvable in logarithmic memory by alternating Turing machines. P is also known to be no larger than PSPACE, the class of problems decidable in polynomial space. Again, whether P = PSPACE is an open problem. To summarize:
Here, EXPTIME is the class of problems solvable in exponential time. Of all the classes shown above, only two strict containments are known:
- P is strictly contained in EXPTIME. Consequently, all EXPTIME-hard problems lie outside P, and at least one of the containments to the right of P above is strict (in fact, it is widely believed that all three are strict).
- L is strictly contained in PSPACE.
The most difficult problems in P are P-complete problems.
Another generalization of P is P/poly, or Nonuniform Polynomial-Time. If a problem is in P/poly, then it can be solved in deterministic polynomial time provided that an advice string is given that depends only on the length of the input. Unlike for NP, however, the polynomial-time machine doesn't need to detect fraudulent advice strings; it is not a verifier. P/poly is a large class containing nearly all practical problems, including all of BPP. If it contains NP, then the polynomial hierarchy collapses to the second level. On the other hand, it also contains some impractical problems, including some undecidable problems such as the unary version of any undecidable problem.
In 1999, Jin-Yi Cai and D. Sivakumar, building on work by Mitsunori Ogihara, showed that if there exists a sparse language that is P-complete, then L = P.[4]
Properties
Polynomial-time algorithms are closed under composition. Intuitively, this says that if one writes a function that is polynomial-time assuming that function calls are constant-time, and if those called functions themselves require polynomial time, then the entire algorithm takes polynomial time. One consequence of this is that P is low for itself. This is also one of the main reasons that P is considered to be a machine-independent class; any machine "feature", such as random access, that can be simulated in polynomial time can simply be composed with the main polynomial-time algorithm to reduce it to a polynomial-time algorithm on a more basic machine.
Languages in P are also closed under reversal, intersection, union, Kleene closure, inverse homomorphism, and complementation.[5]
Pure existence proofs of polynomial-time algorithms
Some problems are known to be solvable in polynomial-time, but no concrete algorithm is known for solving them. For example, the Robertson–Seymour theorem guarantees that there is a finite list of forbidden minors that characterizes (for example) the set of graphs that can be embedded on a torus; moreover, Robertson and Seymour showed that there is an O(n3) algorithm for determining whether a graph has a given graph as a minor. This yields a nonconstructive proof that there is a polynomial-time algorithm for determining if a given graph can be embedded on a torus, despite the fact that no concrete algorithm is known for this problem.
Alternative characterizations
In descriptive complexity, P can be described as the problems expressible in FO(LFP), the first-order logic with a least fixed point operator added to it, on ordered structures. In Immerman's 1999 textbook on descriptive complexity,[6] Immerman ascribes this result to Vardi[7] and to Immerman.[8]
History
Kozen[9] states that Cobham and Edmonds are "generally credited with the invention of the notion of polynomial time." Cobham invented the class as a robust way of characterizing efficient algorithms, leading to Cobham's thesis. However, H. C. Pocklington, in a 1910 paper,[10][11] analyzed two algorithms for solving quadratic congruences, and observed that one took time "proportional to a power of the logarithm of the modulus" and contrasted this with one that took time proportional "to the modulus itself or its square root", thus explicitly drawing a distinction between an algorithm that ran in polynomial time versus one that did not.
Notes
43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.
References
- 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
My blog: http://www.primaboinca.com/view_profile.php?userid=5889534 - Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Second Edition. MIT Press and McGraw–Hill, 2001. ISBN 0-262-03293-7. Section 34.1: Polynomial time, pp. 971–979.
- 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
My blog: http://www.primaboinca.com/view_profile.php?userid=5889534 - 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
My blog: http://www.primaboinca.com/view_profile.php?userid=5889534 Section 7.2: The Class P, pp. 256–263;.
External links
Hi generally. Let me start by introducing the author, his name is Benjamin Cassity and he totally digs that address. To climb is a thing that we're totally dependent on. California is where her house is but now she is considering additional. After being beyond his part of years he became a postal service worker. See what's new on my website here: http://devolro.com/diablo-gallery
Look at my web blog :: cars
- ↑ Manindra Agrawal, Neeraj Kayal, Nitin Saxena, "PRIMES is in P", Annals of Mathematics 160 (2004), no. 2, pp. 781–793.
- ↑ 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
My blog: http://www.primaboinca.com/view_profile.php?userid=5889534 - ↑ Johnsonbaugh, Richard; Schaefer, Marcus, Algorithms, 2004 Pearson Education, page 458, ISBN 0-02-360692-4
- ↑ Jin-Yi Cai and D. Sivakumar. Sparse hard sets for P: resolution of a conjecture of Hartmanis. Journal of Computer and System Sciences, volume 58, issue 2, pp.280–296. 1999. ISSN:0022-0000. At Citeseer
- ↑ 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
My blog: http://www.primaboinca.com/view_profile.php?userid=5889534 - ↑ 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
My blog: http://www.primaboinca.com/view_profile.php?userid=5889534 - ↑ 55 years old Systems Administrator Antony from Clarence Creek, really loves learning, PC Software and aerobics. Likes to travel and was inspired after making a journey to Historic Ensemble of the Potala Palace.
You can view that web-site... ccleaner free download - ↑ 55 years old Systems Administrator Antony from Clarence Creek, really loves learning, PC Software and aerobics. Likes to travel and was inspired after making a journey to Historic Ensemble of the Potala Palace.
You can view that web-site... ccleaner free download Revised version in Information and Control, 68 (1986), 86–104. - ↑ 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
My blog: http://www.primaboinca.com/view_profile.php?userid=5889534 - ↑ One of the biggest reasons investing in a Singapore new launch is an effective things is as a result of it is doable to be lent massive quantities of money at very low interest rates that you should utilize to purchase it. Then, if property values continue to go up, then you'll get a really high return on funding (ROI). Simply make sure you purchase one of the higher properties, reminiscent of the ones at Fernvale the Riverbank or any Singapore landed property Get Earnings by means of Renting
In its statement, the singapore property listing - website link, government claimed that the majority citizens buying their first residence won't be hurt by the new measures. Some concessions can even be prolonged to chose teams of consumers, similar to married couples with a minimum of one Singaporean partner who are purchasing their second property so long as they intend to promote their first residential property. Lower the LTV limit on housing loans granted by monetary establishments regulated by MAS from 70% to 60% for property purchasers who are individuals with a number of outstanding housing loans on the time of the brand new housing purchase. Singapore Property Measures - 30 August 2010 The most popular seek for the number of bedrooms in Singapore is 4, followed by 2 and three. Lush Acres EC @ Sengkang
Discover out more about real estate funding in the area, together with info on international funding incentives and property possession. Many Singaporeans have been investing in property across the causeway in recent years, attracted by comparatively low prices. However, those who need to exit their investments quickly are likely to face significant challenges when trying to sell their property – and could finally be stuck with a property they can't sell. Career improvement programmes, in-house valuation, auctions and administrative help, venture advertising and marketing, skilled talks and traisning are continuously planned for the sales associates to help them obtain better outcomes for his or her shoppers while at Knight Frank Singapore. No change Present Rules
Extending the tax exemption would help. The exemption, which may be as a lot as $2 million per family, covers individuals who negotiate a principal reduction on their existing mortgage, sell their house short (i.e., for lower than the excellent loans), or take part in a foreclosure course of. An extension of theexemption would seem like a common-sense means to assist stabilize the housing market, but the political turmoil around the fiscal-cliff negotiations means widespread sense could not win out. Home Minority Chief Nancy Pelosi (D-Calif.) believes that the mortgage relief provision will be on the table during the grand-cut price talks, in response to communications director Nadeam Elshami. Buying or promoting of blue mild bulbs is unlawful.
A vendor's stamp duty has been launched on industrial property for the primary time, at rates ranging from 5 per cent to 15 per cent. The Authorities might be trying to reassure the market that they aren't in opposition to foreigners and PRs investing in Singapore's property market. They imposed these measures because of extenuating components available in the market." The sale of new dual-key EC models will even be restricted to multi-generational households only. The models have two separate entrances, permitting grandparents, for example, to dwell separately. The vendor's stamp obligation takes effect right this moment and applies to industrial property and plots which might be offered inside three years of the date of buy. JLL named Best Performing Property Brand for second year running
The data offered is for normal info purposes only and isn't supposed to be personalised investment or monetary advice. Motley Fool Singapore contributor Stanley Lim would not personal shares in any corporations talked about. Singapore private home costs increased by 1.eight% within the fourth quarter of 2012, up from 0.6% within the earlier quarter. Resale prices of government-built HDB residences which are usually bought by Singaporeans, elevated by 2.5%, quarter on quarter, the quickest acquire in five quarters. And industrial property, prices are actually double the levels of three years ago. No withholding tax in the event you sell your property. All your local information regarding vital HDB policies, condominium launches, land growth, commercial property and more
There are various methods to go about discovering the precise property. Some local newspapers (together with the Straits Instances ) have categorised property sections and many local property brokers have websites. Now there are some specifics to consider when buying a 'new launch' rental. Intended use of the unit Every sale begins with 10 p.c low cost for finish of season sale; changes to 20 % discount storewide; follows by additional reduction of fiftyand ends with last discount of 70 % or extra. Typically there is even a warehouse sale or transferring out sale with huge mark-down of costs for stock clearance. Deborah Regulation from Expat Realtor shares her property market update, plus prime rental residences and houses at the moment available to lease Esparina EC @ Sengkang - ↑ 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
My blog: http://www.primaboinca.com/view_profile.php?userid=5889534