TY - GEN A1 - Meer, Klaus T1 - On the relations between discrete and continuous complexity theory T2 - Mathematical Logic Quarterly N2 - Relations between discrete and continuous complexity models are considered. The present paper is devoted to combine both models. In particular we analyze the 3-Satisfiability problem. The existence of fast decision procedures for this problem over the reals is examined based on certain conditions on the discrete setting. Moreover we study the behaviour of exponential time computations over the reals depending on the real complexity of 3-Satisfiability. This will be done using tools from complexity theory over the integers. KW - Real model of computation KW - 3-Satisfiability KW - Sparseness KW - Exponential-time computations Y1 - 2016 UR - https://opus4.kobv.de/opus4-UBICO/frontdoor/index/index/docId/15887 UR - http://onlinelibrary.wiley.com/doi/10.1002/malq.19950410214/abstract SN - 0885-064X VL - 41 IS - 2 SP - 281 EP - 286 ER -