Skip to search formSkip to main contentSkip to account menu

Journal of Symbolic Computation

Known as: J. Symbolic Computation 
The Journal of Symbolic Computation is a peer-reviewed monthly scientific journal covering all aspects of symbolic computation published by Academic… 
Wikipedia (opens in a new tab)

Related topics

Related topics

14 relations
Automated theorem provingComputational geometryComputer algebra systemComputer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Polynomial Constraint Solving over Finite Domains with the Modified Bernstein Form
This paper describes an algorithm that can be used to effectively solve polynomial constraints over finite domains. Such… 
2016
2016
Efficient sparse polynomial factoring using the Funnel heap
This work is a comprehensive extension of Abu-Salem et al. (2015) that investigates the prowess of the Funnel Heap for… 
2012
2012
Sequentiality in Real Number Computation
1 Introduction 31.1 Classes of Numbers . . . . . . . . . . . . . . . . . . . . . . . . . 31.1.1 Countable Sets of Numbers: N, Z… 
2010
2010
Journal of Symbolic Computation External and Internal Syntax of the Λ-calculus
It is well known that formally defining and reasoning about languages with binding (such as logics and λ-calculii) is problematic… 
2008
2008
Functions and Polynomials over Finite Groups from the Computational Perspective
In the thesis we investigate the connections between arbitrary functions and their realizing polynomials over nite algebras. We… 
Highly Cited
2005
Highly Cited
2005
Preserving the Confidentiality of Categorical Statistical Data Bases When Releasing Information for Association Rules*
In the statistical literature, there has been considerable development of methods of data releases for multivariate categorical… 
2005
2005
SAT-Based Cooperative Planning: A Proposal
We present a work-in-progress on distributed planning, which relies on the “planning as satisfiability” paradigm. It allows for… 
2002
2002
Runtime Service Composition via Logic-Based Program Synthesis
Dynamic composition of services from components at runtime can help to provide flexible service infrastructures, but requires… 
1998
1998
Parallel Implementation of Schönhage's Integer GCD Algorithm
We present a parallel implementation of Schonhage's integer GCD algorithm on distributed memory architectures. Results are… 
1993
1993
Hardware-Verification using First Order BDDs
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)