Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

14 relations
Automated theorem provingComputational geometryComputer algebra systemComputer science
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
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… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 6
Is this relevant?
2013
2013
Recovering and Utilizing Partial Duality in QBF
Quantified Boolean Formula (QBF) solvers that utilize non-CNF representations are able to reason dually about conflicts and… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
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… Expand
Is this relevant?
2009
2009
Artifact-Centric Workflow Dominance
In this paper we initiate a study on comparing artifact-centric workflow schemas, in terms of the ability of one schema to… Expand
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Markov bases of three-way tables are arbitrarily complicated
We show the following two universality statements on the entry-ranges and Markov bases of spaces of 3-way contingency tables with… Expand
Is this relevant?
2006
2006
SATU : A SYSTEM FOR DISTRIBUTED PROPOSITIONAL SATISFIABILITY CHECKING IN COMPUTATIONAL GRIDS
In addition to data storage and indexing systems, computational grids are used for solving computationally demanding tasks… Expand
  • figure 4.1
  • figure 5.2
  • figure 5.4
  • figure 5.6
  • figure 5.7
Is this relevant?
2005
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… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
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… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
1996
1996
Turchin's Supercompiler Revisited - An operational theory of positive information propagation
Turchin`s supercompiler is a program transformer that includes both partial evaluation and deforestation. Although known in the… Expand
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Fast Parallel Absolute Irreducibility Testing
We present a fast parallel deterministic algorithm for testing multivariate integral polynomials for absolute irreducibility… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE