Sciweavers

1729 search results - page 140 / 346
» Deterministic Expressions in C
Sort
View
FOCS
1997
IEEE
15 years 10 months ago
The Computational Complexity of Knot and Link Problems
We consider the problem of deciding whether a polygonal knot in 3dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that...
Joel Hass, J. C. Lagarias, Nicholas Pippenger
PODC
1997
ACM
15 years 10 months ago
Determining Consensus Numbers
Conditions on a shared object type T are given that are both necessary and sufficient for wait-free n-process consensus to be solvable using objects of type T and registers. The co...
Eric Ruppert
STOC
1989
ACM
96views Algorithms» more  STOC 1989»
15 years 10 months ago
Optimal Size Integer Division Circuits
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division  nding reciprocals that...
John H. Reif, Stephen R. Tate
FMCAD
2004
Springer
15 years 10 months ago
Bloom Filters in Probabilistic Verification
Abstract. Probabilistic techniques for verification of finite-state transition systems offer huge memory savings over deterministic techniques. The two leading probabilistic scheme...
Peter C. Dillinger, Panagiotis Manolios
FOCS
2004
IEEE
15 years 10 months ago
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...
Brian C. Dean, Michel X. Goemans, Jan Vondrá...