Computing local dimension of a semialgebraic set
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Are lower bounds easier over the reals?
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Complexity estimates depending on condition and round-off error
Journal of the ACM (JACM)
On the complexity of diophantine geometry in low dimensions (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Discontinuities in recurrent neural networks
Neural Computation
Algorithm 795: PHCpack: a general-purpose solver for polynomial systems by homotopy continuation
ACM Transactions on Mathematical Software (TOMS)
Journal of VLSI Signal Processing Systems - Special issue on spatiotemporal signal processing with analog CNN visual microprocessors
Solving polynomial systems (invited talk abstract): a complexity theory viewpoint
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
ACM Transactions on Mathematical Software (TOMS)
Univariate polynomials: nearly optimal algorithms for factorization and rootfinding
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
New complexity bounds for cylindrical decompositions of sub-pfaffian sets
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Abstract computability and algebraic specification
ACM Transactions on Computational Logic (TOCL)
Lower bounds for some decision problems over C
Theoretical Computer Science
Minds and Machines
Transfer theorems via sign conditions
Information Processing Letters
Is There a Nonrecursive Decidable Equational Theory?
Minds and Machines
Minds and Machines
Classical physics and the Church--Turing Thesis
Journal of the ACM (JACM)
A formula for separating small roots of a polynomial
ACM SIGSAM Bulletin
Probabilistic analysis of condition numbers for linear programming
Journal of Optimization Theory and Applications
Minds and Machines
Uniform computational complexity of the derivatives of C∞-functions
Theoretical Computer Science
Relations between roots and coefficients, interpolation and application to system solving
Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
Univariate polynomials: nearly optimal algorithms for numerical factorization and root-finding
Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
ACM Transactions on Computational Logic (TOCL)
A theory of complexity for continuous time systems
Journal of Complexity
Real computations with fake numbers
Journal of Complexity
Newton's method for analytic systems of equations with constant rank derivatives
Journal of Complexity
Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Query Languages for Real Number Databases Based on Descriptive Complexity over R
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
There Are No Sparse NPW-Hard Sets
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Real Computations with Fake Numbers
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Similarity Assessment for Generalizied Cases by Optimization Methods
ECCBR '02 Proceedings of the 6th European Conference on Advances in Case-Based Reasoning
Lower Bounds Are Not Easier over the Reals: Inside PH
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
A Computational Framework for Convergent Agents
IDEAL '00 Proceedings of the Second International Conference on Intelligent Data Engineering and Automated Learning, Data Mining, Financial Engineering, and Intelligent Agents
Some Remarks on the L-Conjecture
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
The Stability of Saturated Linear Dynamical Systems Is Undecidable
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Circuits versus Trees in Algebraic Complexity
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Towards Limit Computable Mathematics
TYPES '00 Selected papers from the International Workshop on Types for Proofs and Programs
On the Ultimate Complexity of Factorials
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Learning from Approximate Data
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Optimization Problems Categories
Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
Relativistic Computers and Non-uniform Complexity Theory
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
On the Power of Interactive Computing
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
The Computational Limits to the Cognitive Power of the Neuroidal Tabula Rasa
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Une tentative malheureuse do construire une structure éliminant rapidement les quanteurs
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Additive Complexity and Roots of Polynomials over Number Fields and \mathfrak{p} -adic Fields
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Invited Paper: Computable Partial Solids and Voxels Sets
DCGI '99 Proceedings of the 8th International Conference on Discrete Geometry for Computer Imagery
Query Languages for Constraint Databases: First-Order Logic, Fixed-Points, and Convex Hulls
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Factoring multivariate polynomials via partial differential equations
Mathematics of Computation
Pseudozeros of multivariate polynomials
Mathematics of Computation
P ≠ NC over the p-adic numbers
Journal of Complexity
Computer algebra handbook
Probabilistic analysis of a differential equation for linear programming
Journal of Complexity
Polynomiography and applications in art, education, and science
ACM SIGGRAPH 2003 Educators Program
Limits of theory sequences over algebraically closed fields and applications
Discrete Applied Mathematics - Discrete mathematics and theoretical computer science (DMTCS)
Undecidability in the Imitation Game
Minds and Machines
On the P-NP problem over real matrix rings
Theoretical Computer Science
Counting complexity classes for numeric computations II: algebraic and semialgebraic sets
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Polynomial equation solving by lifting procedures for ramified fibers
Theoretical Computer Science - Algebraic and numerical algorithm
High probability analysis of the condition number of sparse polynomial systems
Theoretical Computer Science - Algebraic and numerical algorithm
Hypercomputation by definition
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
On invariance of degree for certain computations
Journal of Complexity
Abstract versus concrete computation on metric partial algebras
ACM Transactions on Computational Logic (TOCL)
Register cellular automata in the hyperbolic plane
Fundamenta Informaticae
Computability in linear algebra
Theoretical Computer Science
On the ultimate complexity of factorials
Theoretical Computer Science
Straight-line programs and torsion points on elliptic curves
Computational Complexity
Guest Column: NP-complete problems and physical reality
ACM SIGACT News
Real recursive functions and their hierarchy
Journal of Complexity
On solving univariate sparse polynomials in logarithmic time
Journal of Complexity - Special issue: Foundations of computational mathematics 2002 workshops
Shortest path amidst disc obstacles is computable
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Optimal random number generation from a biased coin
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Symbolic-numeric completion of differential systems by homotopy continuation
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Encyclopedia of Computer Science
An optical model of computation
Theoretical Computer Science
On the Complexity of Real Functions
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Preface: Festschrift in honor of Arnold Schönhage
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
On the expressiveness and decidability of o-minimal hybrid systems
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
P = NP for some structures over the binary words
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Two situations with unit-cost: ordered abelian semi-groups and some commutative rings
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Counterexamples to the uniformity conjecture
Computational Geometry: Theory and Applications - Special issue on robust geometric algorithms and their implementations
Elementarily computable functions over the real numbers and R-sub-recursive functions
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Three concepts of decidability for general subsets of uncountable spaces
Theoretical Computer Science - Real numbers and computers
Implicit complexity over an arbitrary structure: quantifier alternations
Information and Computation
Simulation of simultaneous safe recursion over an arbitrary structure
Information Processing Letters
On approximate learning by multi-layered feedforward circuits
Theoretical Computer Science - Algorithmic learning theory (ALT 2000)
Newton's method with deflation for isolated singularities of polynomial systems
Theoretical Computer Science
ACM Transactions on Mathematical Software (TOMS)
Effectively open real functions
Journal of Complexity
On the probability distribution of singular varieties of given corank
Journal of Symbolic Computation
Quantitative temporal logics over the reals: PSpace and below
Information and Computation
A new conceptual framework for analog computation
Theoretical Computer Science
On the complexity of p-adic basic semi-algebraic sets
Journal of Complexity
A New Complexity Result on Solving the Markov Decision Problem
Mathematics of Operations Research
Constructing non-computable Julia sets
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
On approximate triangular decompositions in dimension zero
Journal of Symbolic Computation
Digital hyperplane recognition in arbitrary fixed dimension within an algebraic computation model
Image and Vision Computing
A lower bound on complexity of optimization on the Wiener space
Theoretical Computer Science
Parallel computation in spiking neural nets
Theoretical Computer Science
A note on parallel and alternating time
Journal of Complexity
International Journal of Robotics Research
Optimal integration error on anisotropic classes for restricted Monte Carlo and quantum algorithms
Journal of Approximation Theory
An explicit solution to Post's Problem over the reals
Journal of Complexity
On the number of minima of a random polynomial
Journal of Complexity
The theory of trackability with applications to sensor networks
ACM Transactions on Sensor Networks (TOSN)
Newton's method for sections on Riemannian manifolds: Generalized covariant α-theory
Journal of Complexity
Kantorovich's type theorems for systems of equations with constant rank derivatives
Journal of Computational and Applied Mathematics
Rational Univariate Reduction via toric resultants
Journal of Symbolic Computation
Semidefinite programming and arithmetic circuit evaluation
Discrete Applied Mathematics
RZ: A Tool for Bringing Constructive and Computable Mathematics Closer to Programming Practice
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Abstract Geometrical Computation and the Linear Blum, Shub and Smale Model
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Some Aspects of a Complexity Theory for Continuous Time Systems
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
(Short) Survey of Real Hypercomputation
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Vapnik-Chervonenkis Dimension of Parallel Arithmetic Computations
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Finiteness Properties of Some Families of GP-Trees
Current Topics in Artificial Intelligence
Theory of Real Computation According to EGC
Reliable Implementation of Real Number Algorithms: Theory and Practice
A numerical algorithm for zero counting, I: Complexity and accuracy
Journal of Complexity
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
Journal of the ACM (JACM)
On Relativizations of the P =? NP Question for Several Structures
Electronic Notes in Theoretical Computer Science (ENTCS)
Kolmogorov Complexity Theory over the Reals
Electronic Notes in Theoretical Computer Science (ENTCS)
ACM Transactions on Computational Logic (TOCL)
Smale's point estimate theory for Newton's method on Lie groups
Journal of Complexity
The Voronoi Diagram of Circles and Its Application to the Visualization of the Growth of Particles
Transactions on Computational Science III
Condition number based complexity estimate for computing local extrema
Journal of Computational and Applied Mathematics
Modelling of Complex Systems: Systems as Dataflow Machines
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Universality for Turing Machines, Inductive Turing Machines and Evolutionary Algorithms
Fundamenta Informaticae - Machines, Computations and Universality, Part I
A note about the average number of real roots of a Bernstein polynomial system
Journal of Complexity
Optimization and NP_R-completeness of certain fewnomials
Proceedings of the 2009 conference on Symbolic numeric computation
Computability of Analytic Functions with Analytic Machines
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
On Ladner's Result for a Class of Real Machines with Restricted Use of Constants
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Real Computable Manifolds and Homotopy Groups
UC '09 Proceedings of the 8th International Conference on Unconventional Computation
Abstract geometrical computation 3: black holes for classical and analog computing
Natural Computing: an international journal
VPSPACE and a transfer theorem over the complex field
Theoretical Computer Science
Counterexamples to the uniformity conjecture
Computational Geometry: Theory and Applications - Special issue on robust geometric algorithms and their implementations
Computational Aspects of Equilibria
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Approximation of the solution of certain nonlinear ODEs with linear complexity
Journal of Computational and Applied Mathematics
Probabilistically Checkable Proofs Over the Reals
Electronic Notes in Theoretical Computer Science (ENTCS)
Hyperbolic Julia Sets are Poly-Time Computable
Electronic Notes in Theoretical Computer Science (ENTCS)
Implicit complexity over an arbitrary structure: Quantifier alternations
Information and Computation
On the expressiveness and decidability of o-minimal hybrid systems
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
P=NP for some structures over the binary words
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Two situations with unit-cost: ordered abelian semi-groups and some commutative rings
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Discounted deterministic Markov decision processes and discounted all-pairs shortest paths
ACM Transactions on Algorithms (TALG)
Stochastic perturbations and smooth condition numbers
Journal of Complexity
Computability over an arbitrary structure: sequential and parallel polynomial time
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Satisfiability of viability constraints for Pfaffian dynamics
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
The image computation problem in hybrid systems model checking
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
On defining integers in the counting hierarchy and proving arithmetic circuit lower bounds
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
VPSPACE and a transfer theorem over the reals
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Fast computations of the exponential function
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Algebraic systems biology: theses and hypotheses
AB'07 Proceedings of the 2nd international conference on Algebraic biology
Universality, reducibility, and completeness
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Decision versus evaluation in algebraic complexity
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Small-space analogues of Valiant's classes
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Tree-width in Algebraic Complexity
Fundamenta Informaticae - Bridging Logic and Computer Science: to Johann A. Makowsky for his 60th birthday
Solving polynomial equations in smoothed polynomial time and a near solution to smale's 17th problem
Proceedings of the forty-second ACM symposium on Theory of computing
Complexity of the Bollobás-Riordan polynomial: exceptional points and uniform reductions
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Polynomial homotopies on multicore workstations
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Journal of Symbolic Computation
Graph homomorphisms with complex values: a dichotomy theorem
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Space-efficient scheduling of stochastically generated tasks
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
On models and query languages for probabilistic processes
ACM SIGMOD Record
Local convergence analysis of the Gauss-Newton method under a majorant condition
Journal of Complexity
Cellular Automata, Decidability and Phasespace
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Arithmetic Circuits: A survey of recent results and open questions
Foundations and Trends® in Theoretical Computer Science
Condition number based complexity estimate for solving polynomial systems
Journal of Computational and Applied Mathematics
Local convergence analysis of inexact Newton-like methods under majorant condition
Computational Optimization and Applications
Querying probabilistic business processes for sub-flows
Proceedings of the 14th International Conference on Database Theory
Optimizing n-variate (n+k)-nomials for small k
Theoretical Computer Science
Beyond convexity: new perspectives in computational optimization
SEAL'10 Proceedings of the 8th international conference on Simulated evolution and learning
Lower complexity bounds for interpolation algorithms
Journal of Complexity
On the Complexity of Nash Equilibria and Other Fixed Points
SIAM Journal on Computing
On the Complexity of Nonnegative Matrix Factorization
SIAM Journal on Optimization
A computational proof of complexity of some restricted counting problems
Theoretical Computer Science
On the solution of systems of equations with constant rank derivatives
Numerical Algorithms
A characterization of computable analysis on unbounded domains using differential equations
Information and Computation
Almost transparent short proofs for NPR
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Time-bounded verification of CTMCs against real-time specifications
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Sampling algebraic sets in local intrinsic coordinates
Computers & Mathematics with Applications
Differential dynamic logics: automated theorem proving for hybrid systems
Differential dynamic logics: automated theorem proving for hybrid systems
SIAM Journal on Scientific Computing
Semantics and Computability of the Evolution of Hybrid Systems
SIAM Journal on Control and Optimization
Computational Complexity of Holant Problems
SIAM Journal on Computing
On Ladner's result for a class of real machines with restricted use of constants
Information and Computation
Space-efficient scheduling of stochastically generated tasks
Information and Computation
Noise vs computational intractability in dynamics
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Approximation classes for real number optimization problems
UC'06 Proceedings of the 5th international conference on Unconventional Computation
Computing graph polynomials on graphs of bounded clique-width
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
A measure of space for computing over the reals
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
From a zoo to a zoology: descriptive complexity for graph polynomials
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Optimization and approximation problems related to polynomial system solving
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Uncomputability below the real halting problem
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Fast quantifier elimination means p = NP
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Local convergence analysis of inexact Gauss-Newton like methods under majorant condition
Journal of Computational and Applied Mathematics
Low dimensional hybrid systems - decidable, undecidable, don't know
Information and Computation
Valiant's model: from exponential sums to exponential products
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Two logical hierarchies of optimization problems over the real numbers
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
On the approximation of interval functions
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
The computational power of continuous dynamic systems
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
On the decidability of tracing problems in dynamic geometry
ADG'04 Proceedings of the 5th international conference on Automated Deduction in Geometry
Algorithmic algebraic model checking i: challenges from systems biology
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
An explicit solution to post's problem over the reals
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
The complexity of semilinear problems in succinct representation
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
How to compare the power of computational models
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Abstract geometrical computation: turing-computing ability and undecidability
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Towards computability of higher type continuous data
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
On some relations between approximation problems and PCPs over the real numbers
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Complexity of continuous space machine operations
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
The legacy of turing in numerical analysis
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
A geometric algorithm for winding number computation with complexity analysis
Journal of Complexity
Computing a nonnegative matrix factorization -- provably
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Survey: Equilibria, fixed points, and complexity classes
Computer Science Review
Algorithm 921: alphaCertified: Certifying Solutions to Polynomial Systems
ACM Transactions on Mathematical Software (TOMS)
Universality for Turing Machines, Inductive Turing Machines and Evolutionary Algorithms
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Modelling of Complex Systems: Systems as Dataflow Machines
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Analogs of fagin's theorem for small nondeterministic finite automata
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Register Cellular Automata in the Hyperbolic Plane
Fundamenta Informaticae
Journal of Computational and Applied Mathematics
Spin systems on k-regular graphs with complex edge functions
Theoretical Computer Science
VPSPACE and a transfer theorem over the complex field
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Real computational universality: the word problem for a class of groups with infinite presentation
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Exotic quantifiers, complexity classes, and complete problems
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Software Engineering and complexity in effective Algebraic Geometry
Journal of Complexity
LTL model checking of interval markov chains
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
On the boolean complexity of real root refinement
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Partition functions on k-regular graphs with {0,1}-vertex assignments and real edge functions
Theoretical Computer Science
An Arithmetic Poisson Formula for the multi-variate resultant
Journal of Complexity
Computing with real numbers, from Archimedes to Turing and beyond
Communications of the ACM
Most Tensor Problems Are NP-Hard
Journal of the ACM (JACM)
Universal gates in other universes
RC'13 Proceedings of the 5th international conference on Reversible Computation
On the Query Complexity of Real Functionals
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.03 |