Filters








383,241 Hits in 7.1 sec

Simple Random Logic Programs [chapter]

Gayathri Namasivayam, Mirosław Truszczyński
2009 Lecture Notes in Computer Science  
We also show that the hardness of programs from the hard region grows quickly with the number of atoms.  ...  We study experimentally how hard it is to compute answer sets of such programs. For programs that are constraint-free and purely negative we show that the easy-hard-easy pattern emerges.  ...  of programs, namely those with sufficiently many constraints, a transition from consistent to inconsistent programs can be observed (Zhao and Lin's model shows such transition, too).  ... 
doi:10.1007/978-3-642-04238-6_20 fatcat:dfrfsnvrmzgfjfvuvnl3qp3nre

Simple strategies for large zero-sum games with applications to complexity theory

Richard J. Lipton, Neal E. Young
1994 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94  
As a corollary, it follows that every language has small "hard" multisets of inputs certifying that small circuits can't decide the language.  ...  This paper gives an elementary proof that each player has a near-optimal mixed strategy that chooses uniformly at random from a multiset of pure strategies of size logarithmic in the number of pure strategies  ...  Taking c = 1/6 -1, for k = 0(s/ log(l/6)), there exists a size k set of inputs such that, for any program, the complexity of the program is more than O = 1 -6(1+ c) on some input in the set.  ... 
doi:10.1145/195058.195447 dblp:conf/stoc/LiptonY94 fatcat:objzumhl2fbtndimazd3nc5fh4

Mutant Quality Indicators

Papadakis Mike, Thierry Titcheu Chekam, Yves Le Traon
2018 2018 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW)  
We analyse a large set of mutants from 3,902 (real) faulty program versions, belonging to 40 fault classes, collected from an on-line programming contest.  ...  We identify two classes of indicators, related to individual mutants (Fault Revealing, Subsuming, Hard-to-kill and Stubborn) and to mutant sets (disjoint/dominator and distinguished).  ...  Hard-to-kill (Hard) are the mutants that are killed only by a small fraction of test cases. We consider two classes of hardto-kill mutants.  ... 
doi:10.1109/icstw.2018.00025 dblp:conf/icst/PapadakisCT18 fatcat:33742l2xpjed3boxvyzrikt7hi

Complexity of necessary efficiency in interval linear programming and multiobjective linear programming

Milan Hladík
2011 Optimization Letters  
Provided that x * is a non-degenerate basic solution, the problem is polynomially solvable for one objective, but remains co-NP-hard in the general case.  ...  We present some complexity results on checking necessary efficiency in interval multiobjective linear programming.  ...  Proof First we show that checking Z ∞,1 > 1 is NP-hard on a class of symmetric rational M-matrices; it is a modification of a result by Rohn [22] .  ... 
doi:10.1007/s11590-011-0315-1 fatcat:ek3zgfqairgadgbcrtpg5mahfq

Mining Circuit Lower Bound Proofs for Meta-Algorithms

Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman
2015 Computational Complexity  
We get nontrivial compression for functions computable by AC 0 circuits, (de Morgan) formulas, and (read-once) branching programs of the size for which the lower bounds for the corresponding circuit class  ...  This complements Williams's result [55] that any non-trivial Circuit-SAT algorithm for a circuit class C would imply a superpolynomial lower bound against C for a language in NEXP 1 .  ...  When both these events happen, we get a small-size de Morgan formula that can be used to compute the bits of x 0 , which contradicts the assumed hardness of x 0 .  ... 
doi:10.1007/s00037-015-0100-0 fatcat:r625fgu375arxokmoistrnflgu

Mining Circuit Lower Bound Proofs for Meta-algorithms

Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman
2014 2014 IEEE 29th Conference on Computational Complexity (CCC)  
We get nontrivial compression for functions computable by AC 0 circuits, (de Morgan) formulas, and (read-once) branching programs of the size for which the lower bounds for the corresponding circuit class  ...  This complements Williams's result [55] that any non-trivial Circuit-SAT algorithm for a circuit class C would imply a superpolynomial lower bound against C for a language in NEXP 1 .  ...  When both these events happen, we get a small-size de Morgan formula that can be used to compute the bits of x 0 , which contradicts the assumed hardness of x 0 .  ... 
doi:10.1109/ccc.2014.34 dblp:conf/coco/ChenKKSZ14 fatcat:7sv5lgqvh5he7h2x7k4i67auj4

Uniqueness in quadratic and hyperbolic 0–1 programming problems

Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
2013 Operations Research Letters  
We analyze the question of deciding whether a quadratic or a hyperbolic 0-1 programming instance has a unique optimal solution.  ...  Both uniqueness questions are known to be NP-hard, but are unlikely to be contained in the class NP.  ...  Bettina Klinz 5 acknowledges partial financial support by the FWF program W 1230-N13.  ... 
doi:10.1016/j.orl.2013.08.013 fatcat:2fmbgitgmrcs7abzfoyqt2ylxq

Simple but Hard Mixed Horn Formulas [chapter]

Gayathri Namasivayam, Mirosław Truszczyński
2010 Lecture Notes in Computer Science  
Preliminaries Let V = {v 1 , v 2 , . . .} be a fixed set of propositional variables. We define the class MH n (k, m), where k ≥ 1 and m ≥ 0, to consist of MHFs F such that  ...  We study simple classes of mixed Horn formulas, in which the structure of the Horn part is drastically constrained.  ...  We note that the class MH 1 n is closely related to a class R − of logic programs studied in [5] and identified as containing programs that are especially hard for the current generation of the answer-set  ... 
doi:10.1007/978-3-642-14186-7_36 fatcat:rzc5yqmu4nfrjo46vkhtqjuiu4

Solving a Real Constraint Satisfaction Model for the University Course Timetabling Problem: A Case Study

Marco Antonio Cruz-Chávez, Mireya Flores-Pichardo, Alina Martínez-Oropeza, Pedro Moreno-Bernal, Martín H. Cruz-Rosales
2016 Mathematical Problems in Engineering  
Using the constraint satisfaction model, it is possible to improve the allocation of class hours in the FCSE so that classroom use is more efficient.  ...  This paper proposes a real mathematical constraint satisfaction model which defines the timetabling problem in the Faculty of Chemical Sciences and Engineering (FCSE) at the Autonomous University of Morelos  ...  Class ID Coding Need 1 0 1 1 1 0 1 0 2 1 2 1 2 0 2 0  ... 
doi:10.1155/2016/7194864 fatcat:bnsjm2pxzfcdtlgpo565l23i6e

Improved hardness amplification in NP

Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu
2007 Theoretical Computer Science  
of size s (n) fails to compute it on a 1/2 − 1/s (n) fraction of inputs, with s (n) = 2 Ω (n 2/3 ) .  ...  We study the problem of hardness amplification in NP.  ...  {0, 1} t is called an ε-PRG for a class of functions from {0, 1} t to {0, 1} if for any T in this class, |Pr [T (U t )] − Pr [T (G(U ))]| ≤ ε.  ... 
doi:10.1016/j.tcs.2006.10.009 fatcat:wcrz2hoh6rdi7pxeutndueb3rm

Fitting a graph to vector data

Samuel I. Daitch, Jonathan A. Kelner, Daniel A. Spielman
2009 Proceedings of the 26th Annual International Conference on Machine Learning - ICML '09  
We introduce a measure of how well a combinatorial graph fits a collection of vectors.  ...  The optimal graphs under this measure may be computed by solving convex quadratic programs and have many interesting properties.  ...  Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Fitting a Graph to Vector  ... 
doi:10.1145/1553374.1553400 dblp:conf/icml/DaitchKS09 fatcat:kernzs5ozvfxlbnfmvta24ybyi

Process-Oriented Parallel Programming with an Application to Data-Intensive Computing [article]

Edward Givelberg
2014 arXiv   pre-print
It is based on the observation that every class of an object-oriented language can be instantiated as a process, accessible via a remote pointer.  ...  We introduce process-oriented programming as a natural extension of object-oriented programming for parallel computing.  ...  Each process maintains a buffer that can hold a page line, where a page line is a collection of N P 3 pages with page indices {(i 1 , i 2 , i 3 ) : i 3 = 0, 1, . . . , N P 3 − 1} .  ... 
arXiv:1407.5524v1 fatcat:bexpsjdvhvfs3f2j7labajzeki

Geometric insights into support vector machine behavior using the KKT conditions

Iain Carmichael, J. S. Marron
2021 Electronic Journal of Statistics  
For example, we show that in many cases SVM can be viewed as a cropped version of these classifiers.  ...  The support vector machine (SVM) is a powerful and widely used classification algorithm.  ...  Recall the convex hull of a set of points is given by H({x i } n i=1 ) := { m i=1 λ i x i | n i=1 λ i = 1, λ i ≥ 0}.  ... 
doi:10.1214/21-ejs1902 fatcat:ted7hrzu35c5xpz5n4bf5jud6a

The Seventh Answer Set Programming Competition: Design and Results [article]

Martin Gebser, Marco Maratea, Francesco Ricca
2019 arXiv   pre-print
Answer Set Programming (ASP) is a prominent knowledge representation language with roots in logic programming and non-monotonic reasoning.  ...  In this paper, we report on the design and results of the Seventh ASP Competition, jointly organized by the University of Calabria (Italy), the University of Genova (Italy), and the University of Potsdam  ...  Finally, we thank all solver and benchmark contributors, and participants, who worked hard to make this competition possible.  ... 
arXiv:1904.09134v1 fatcat:nbeavbrnfvh6vjirztvfwgry5a

Page 5951 of Mathematical Reviews Vol. , Issue 2000h [page]

2000 Mathematical Reviews  
Kaul (Delhi) 2000h:90042 90C09 90C57 90C59 Cornuéjols, Gérard (1-CMU-I; Pittsburgh, PA); Dawande, Milind (1-IBM; Yorktown Heights, NY) A class of hard small 0-1 programs.  ...  For computational experiments, instances from this class of 0-1 programs are gen- erated as follows: a;; uniform integer between 0 and 99 (= D — 1), n = 10(m— 1) and 6; = |} 77_, aij] or, more generally  ... 
« Previous Showing results 1 — 15 out of 383,241 results