| Publication | Date of Publication | Type |
|---|
scientific article; zbMATH DE number 7753415 (Why is no real title available?)
| 2023-10-23 | Paper |
Logics which capture complexity classes over the reals
Fundamentals of Computation Theory | 2022-12-09 | Paper |
A PCP of proximity for real algebraic polynomials
| 2022-03-21 | Paper |
Metafinite model theory and real number computations
| 2021-08-03 | Paper |
Periodic generalized automata over the reals
Information and Computation | 2019-12-18 | Paper |
Automata over infinite sequences of reals
| 2019-12-04 | Paper |
Interactive proofs and a Shamir-like result for real number computations
Computational Complexity | 2019-08-30 | Paper |
Real interactive proofs for VPSPACE
| 2018-03-21 | Paper |
An algebraic proof of the real number PCP theorem
Journal of Complexity | 2017-05-24 | Paper |
The PCP theorem for NP over the reals
| 2017-01-30 | Paper |
Periodic generalized automata over the reals
Language and Automata Theory and Applications | 2016-04-13 | Paper |
Some results on interactive proofs for real computations
Evolving Computability | 2015-10-20 | Paper |
An Algebraic Proof of the Real Number PCP Theorem
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Topics in real and complex number complexity theory
Recent Advances in Real Complexity and Computation | 2015-08-04 | Paper |
The PCP theorem for NP over the reals
Foundations of Computational Mathematics | 2015-07-22 | Paper |
Generalized finite automata over real and complex numbers
Theoretical Computer Science | 2015-07-13 | Paper |
An extended tree-width notion for directed graphs related to the computation of permanents
Theory of Computing Systems | 2015-02-05 | Paper |
Testing Low Degree Trigonometric Polynomials
Computer Science - Theory and Applications | 2014-06-24 | Paper |
Generalized finite automata over real and complex numbers
Lecture Notes in Computer Science | 2014-04-16 | Paper |
Some initial thoughts on bounded query computations over the reals
International Journal of Foundations of Computer Science | 2013-06-06 | Paper |
On Ladner's result for a class of real machines with restricted use of constants
Information and Computation | 2012-05-24 | Paper |
Almost transparent short proofs for \(\mathrm{NP}_{\mathbb R}\)
Fundamentals of Computation Theory | 2011-08-19 | Paper |
An extended tree-width notion for directed graphs related to the computation of permanents
Computer Science – Theory and Applications | 2011-06-17 | Paper |
On the expressive power of CNF formulas of bounded tree- and clique-width
Discrete Applied Mathematics | 2011-01-14 | Paper |
On Ladner's result for a class of real machines with restricted use of constants
Mathematical Theory and Computational Practice | 2010-07-28 | Paper |
Tree-width in algebraic complexity
Fundamenta Informaticae | 2010-05-25 | Paper |
Simulated annealing versus Metropolis for a TSP instance
Information Processing Letters | 2010-03-24 | Paper |
Real computational universality: the word problem for a class of groups with infinite presentation
Foundations of Computational Mathematics | 2009-10-19 | Paper |
On the OBDD size for graphs of bounded tree- and clique-width
Discrete Mathematics | 2009-04-09 | Paper |
On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
On the OBDD Size for Graphs of Bounded Tree- and Clique-Width
Parameterized and Exact Computation | 2008-06-03 | Paper |
An explicit solution to Post's problem over the reals
Journal of Complexity | 2008-03-26 | Paper |
Complexity aspects of a semi-infinite optimization problem†
Optimization | 2008-03-10 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Approximation Classes for Real Number Optimization Problems
Lecture Notes in Computer Science | 2007-11-29 | Paper |
Some Aspects of a Complexity Theory for Continuous Time Systems
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Some relations between approximation problems and PCPs over the real numbers
Theory of Computing Systems | 2007-09-06 | Paper |
Computing minimal multi-homogeneous Bezout numbers is hard
Theory of Computing Systems | 2007-08-23 | Paper |
Logical Approaches to Computational Barriers
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Logical Approaches to Computational Barriers
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Transparent long proofs: A first PCP theorem for \(\text{NP}_{\mathbb R}\)
Foundations of Computational Mathematics | 2006-09-28 | Paper |
Two logical hierarchies of optimization problems over the real numbers
MLQ | 2006-03-24 | Paper |
New Computational Paradigms
Lecture Notes in Computer Science | 2006-01-11 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
scientific article; zbMATH DE number 2119538 (Why is no real title available?)
| 2004-11-29 | Paper |
On a refined analysis of some problems in interval arithmetic using real number complexity theory
Reliable Computing | 2004-08-06 | Paper |
scientific article; zbMATH DE number 1859215 (Why is no real title available?)
| 2003-09-11 | Paper |
scientific article; zbMATH DE number 1942453 (Why is no real title available?)
| 2003-06-30 | Paper |
A Step towards a Complexity Theory for Analog Systems
| 2003-01-08 | Paper |
Some aspects of studying an optimization or decision problem in different computational models
European Journal of Operational Research | 2002-11-20 | Paper |
On the computational structure of the connected components of a hard problem
Information Processing Letters | 2002-07-25 | Paper |
scientific article; zbMATH DE number 1670492 (Why is no real title available?)
| 2001-12-03 | Paper |
scientific article; zbMATH DE number 1504634 (Why is no real title available?)
| 2001-11-09 | Paper |
scientific article; zbMATH DE number 1263207 (Why is no real title available?)
| 2001-08-27 | Paper |
scientific article; zbMATH DE number 1418323 (Why is no real title available?)
| 2001-03-12 | Paper |
Counting problems over the reals
Theoretical Computer Science | 2000-08-21 | Paper |
scientific article; zbMATH DE number 1361497 (Why is no real title available?)
| 1999-11-10 | Paper |
Logics which capture complexity classes over the reals
Journal of Symbolic Logic | 1999-06-29 | Paper |
A survey on real structural complexity theory
Bulletin of the Belgian Mathematical Society - Simon Stevin | 1999-03-14 | Paper |
On the Structure of $\cal NP_\Bbb C$
SIAM Journal on Computing | 1998-09-21 | Paper |
scientific article; zbMATH DE number 1080058 (Why is no real title available?)
| 1997-10-28 | Paper |
Semi-algebraic complexity -- Additive complexity of matrix computational tasks
Journal of Complexity | 1997-08-26 | Paper |
scientific article; zbMATH DE number 953024 (Why is no real title available?)
| 1997-05-12 | Paper |
A note on testing the resultant
Journal of Complexity | 1996-11-10 | Paper |
scientific article; zbMATH DE number 853871 (Why is no real title available?)
| 1996-03-10 | Paper |
On the Relations Between Discrete and Continuous Complexity Theory
Mathematical Logic Quarterly | 1995-12-17 | Paper |
Real number computations: On the use of information
Journal of Symbolic Computation | 1995-04-04 | Paper |
On the complexity of quadratic programming in real number models of computation
Theoretical Computer Science | 1994-11-27 | Paper |
Real number models under various sets of operations
Journal of Complexity | 1994-01-13 | Paper |
A note on a \(P \neq NP\) result for a restricted class of real machines
Journal of Complexity | 1993-02-22 | Paper |
Computations over \(\mathbb{Z}\) and \(\mathbb{R}\): a comparison
Journal of Complexity | 1990-01-01 | Paper |
