The <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>P</mml:mi><mml:mo>≠</mml:mo><mml:mtext><ce:italic>NP</ce:italic></mml:mtext></mml:math> conjecture in the context of real and complex analysis-Reference-Cited by-同舟云学术

The P≠NP conjecture in the context of real and complex analysis

Published:2006-04 Issue:2 Volume:22 Page:287-303
ISSN:0885-064X
Container-title:Journal of Complexity
language:en
Short-container-title:Journal of Complexity

Author:

Mycka Jerzy,Costa José Félix

Publisher

Elsevier BV

Subject

Applied Mathematics,Control and Optimization,Numerical Analysis,Statistics and Probability,Algebra and Number Theory,General Mathematics

Reference17 articles.

1. Structural Complexity I;Balcázar,1995

2. O. Bournez, E. Hainry, Real recursive functions and real extensions of recursive functions, Machines, Computation, Universality (MCU 2004), Lecture Notes in Computer Science, vol. 3354, 2005, Springer, Berlin, pp. 116–127.

3. Continuous-time computation with restricted integration capabilities;Campagnolo;Theoret. Comput. Sci.,2004

4. Iteration, inequalities, and differentiability in analog computers;Campagnolo;J. Complexity,2000

5. An analog characterization of the Grzegorczyk hierarchy;Campagnolo;J. Complexity,2002

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Characterization of Functions over the Integers Computable in Polynomial Time Using Discrete Ordinary Differential Equations;computational complexity;2023-07-12

2. Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length;Journal of the ACM;2017-11-29

3. A survey of recursive analysis and Moore’s notion of real computation;Natural Computing;2011-09-04

4. A foundation for real recursive function theory;Annals of Pure and Applied Logic;2009-09

5. A Survey on Continuous Time Computations;New Computational Paradigms;2008