Sciweavers

434 search results - page 56 / 87
» Monadic Bounded Algebras
Sort
View
ISSRE
2003
IEEE
14 years 3 months ago
Augmenting Simulated Annealing to Build Interaction Test Suites
Component based software development is prone to unexpected interaction faults. The goal is to test as many potential interactions as is feasible within time and budget constraint...
Myra B. Cohen, Charles J. Colbourn, Alan C. H. Lin...
JSYML
2007
85views more  JSYML 2007»
13 years 9 months ago
Substructural fuzzy logics
Substructural fuzzy logics are substructural logics that are complete with respect to algebras whose lattice reduct is the real unit interval [0, 1]. In this paper, we introduce Un...
George Metcalfe, Franco Montagna
FSTTCS
2010
Springer
13 years 7 months ago
The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
Matthew Hague, Anthony Widjaja To
ECCC
2008
168views more  ECCC 2008»
13 years 10 months ago
Algebrization: A New Barrier in Complexity Theory
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
Scott Aaronson, Avi Wigderson

Book
712views
15 years 8 months ago
Network Coding Theory
The book covers several topics such as Acyclic Networks, Cyclic Networks, Network Coding and Algebraic Coding, Superposition Coding and Max-Flow Bound, Network Codes for Acyclic Ne...
Raymond W. Yeung, Shuo-Yen Robert Li, Ning Cai, Zh...