Sciweavers

371 search results - page 57 / 75
» Partition Theorems and Computability Theory
Sort
View
JLP
2007
89views more  JLP 2007»
14 years 9 months ago
Universality and semicomputability for nondeterministic programming languages over abstract algebras
tract Algebras Wei Jiang∗ , Yuan Wang† , and Jeffery Zucker‡ September 11, 2006 The Universal Function Theorem (UFT) originated in 1930s with the work of Alan Turing, who p...
Wei Jiang, Yuan Wang, Jeffery I. Zucker
STOC
2009
ACM
163views Algorithms» more  STOC 2009»
15 years 10 months ago
Non-monotone submodular maximization under matroid and knapsack constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, M...
STOC
2009
ACM
143views Algorithms» more  STOC 2009»
15 years 10 months ago
Affine dispersers from subspace polynomials
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
Eli Ben-Sasson, Swastik Kopparty
ICCAD
2002
IEEE
104views Hardware» more  ICCAD 2002»
15 years 6 months ago
A new enhanced SPFD rewiring algorithm
This paper presents an in-depth study of the theory and algorithms for the SPFD-based (Set of Pairs of Functions to be Distinguished) rewiring, and explores the flexibility in the...
Jason Cong, Joey Y. Lin, Wangning Long
FOSSACS
2007
Springer
15 years 3 months ago
Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems
Desharnais, Gupta, Jagadeesan and Panangaden introduced a family of behavioural pseudometrics for probabilistic transition systems. These pseudometrics are a quantitative analogue ...
Franck van Breugel, Babita Sharma, James Worrell