Sciweavers

6 search results - page 1 / 2
» Rank functions of strict cg-matroids
Sort
View
68
Voted
DM
2008
55views more  DM 2008»
14 years 9 months ago
Rank functions of strict cg-matroids
A matroid-like structure defined on a convex geometry, called a cg-matroid, is defined by S. Fujishige, G. A. Koshevoy, and Y. Sano in [9]. A cg-matroid whose rank function is nat...
Yoshio Sano
APAL
2008
77views more  APAL 2008»
14 years 9 months ago
More on SOP1 and SOP2
This paper continues [Sh500] and [DzSh692]. We present a rank function for NSOP1 theories and give an example of a theory which is NSOP1 but not simple. We also investigate the con...
Saharon Shelah, Alexander Usvyatsov
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
14 years 8 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...
STOC
2010
ACM
200views Algorithms» more  STOC 2010»
15 years 7 months ago
Hardness Amplification in Proof Complexity
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
Paul Beame, Trinh Huynh and Toniann Pitassi
JSS
2006
127views more  JSS 2006»
14 years 9 months ago
An approach to feature location in distributed systems
This paper describes an approach to the feature location problem for distributed systems, that is, to the problem of locating which code components are important in providing a pa...
Dennis Edwards, Sharon Simmons, Norman Wilde