Simulating Probabilistic by Deterministic Algebraic Computation Trees

Theoretical Computer Science - Netherlands
doi 10.1016/0304-3975(85)90079-9
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision and Computation Trees

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1997English

Probabilistic Roadmaps of Trees for Parallel Computation of Multiple Query Roadmaps

Springer Tracts in Advanced Robotics
Electronic EngineeringElectricalArtificial Intelligence
2005English

Deterministic and Probabilistic Voting Models

American Journal of Political Science
SociologyInternational RelationsPolitical Science
1997English

Computation in Linear Algebraic Monoids

Journal of Applied & Computational Mathematics
2014English

Deterministic and Probabilistic Reasons and Causes

Erkenntnis
PhilosophyLogic
1983English

Deterministic Random Walks on Regular Trees

Electronic Notes in Discrete Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2007English

Algebraic Operations on PQ Trees and Modular Decomposition Trees

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Approximate Confidence Computation in Probabilistic Databases

2010English

Deterministic Network Model Revisited: An Algebraic Network Coding Approach

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy