Learning to reason with a restricted view
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Journal of the ACM (JACM)
Finding almost-satisfying assignments
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On the run-time behaviour of stochastic local search algorithms for SAT
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Convergence Properties of Optimization Algorithms for the SAT Problem
IEEE Transactions on Computers
Global Optimization for Satisfiability (SAT) Problem
IEEE Transactions on Knowledge and Data Engineering
A deterministic (2 - 2/(k+ 1))n algorithm for k-SAT based on local search
Theoretical Computer Science
Large scale reconstruction of haplotypes from genotype data
RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
New Algorithms for k -SAT Based on the Local Search Principle
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Scaling Properties of Pure Random Walk on Random 3-SAT
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Reformulating Propositional Satisfiability as Constraint Satisfaction
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Exact algorithms for NP-hard problems: a survey
Combinatorial optimization - Eureka, you shrink!
Parallelizing local search for CNF satisfiability using vectorization and PVM
Journal of Experimental Algorithmics (JEA)
Worst-case study of local search for MAX-k-SAT
Discrete Applied Mathematics - The renesse issue on satisfiability
How efficiently can room at the bottom be traded away for speed at the top?
Natural Computing: an international journal
The Complexity of Boolean Constraint Satisfaction Local Search Problems
Annals of Mathematics and Artificial Intelligence
Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points
Annals of Mathematics and Artificial Intelligence
UnitWalk: A New SAT Solver that Uses Local Search Guided by Unit Clause Elimination
Annals of Mathematics and Artificial Intelligence
On a simple randomized algorithm for finding a 2-factor in sparse graphs
Information Processing Letters
Absorbing Random Walks and the NAE2SAT Problem
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
A comparative runtime analysis of heuristic algorithms for satisfiability problems
Artificial Intelligence
On smoothed k-CNF formulas and the Walksat algorithm
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Detecting Motifs in a Large Data Set: Applying Probabilistic Insights to Motif Finding
BICoB '09 Proceedings of the 1st International Conference on Bioinformatics and Computational Biology
Towards efficient sampling: exploiting random walk strategies
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Simple randomized algorithms for tractable row and tree convex constraints
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Backbone fragility and the local search cost peak
Journal of Artificial Intelligence Research
Domain-independent extensions to GSAT: solving large structured satisfiability problems
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
The comparative linguistics of knowledge representation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Learning to reason the non monotonic case
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
ISICA '09 Proceedings of the 4th International Symposium on Advances in Computation and Intelligence
On a simple randomized algorithm for finding a 2-factor in sparse graphs
Information Processing Letters
A randomized algorithm for BBCSPs in the prover-verifier model
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
A new method for solving hard satisfiability problems
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Using deep structure to locate hard problems
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
An empirical study of greedy local search for satisfiability testing
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Why large CLOSEST STRING instances are easy to solve in practice
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Querying uncertain data with aggregate constraints
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
A full derandomization of schöning's k-SAT algorithm
Proceedings of the forty-third annual ACM symposium on Theory of computing
Algorithms for satisfiability using independent sets of variables
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
A new approach to model counting
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Threshold behaviour of WalkSAT and focused metropolis search on random 3-satisfiability
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Algorithmics in exponential time
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
A survey of approximation results for local search algorithms
Efficient Approximation and Online Algorithms
On the quality and quantity of random decisions in stochastic local search for SAT
AI'06 Proceedings of the 19th international conference on Advances in Artificial Intelligence: Canadian Society for Computational Studies of Intelligence
Survey: A glimpse at Christos H. Papadimitriou
Computer Science Review
Focused most probable world computations in probabilistic logic programs
Annals of Mathematics and Artificial Intelligence
Choosing probability distributions for stochastic local search and the role of make versus break
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Pushing random walk beyond golden ratio
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Principles of stochastic local search
UC'07 Proceedings of the 6th international conference on Unconventional Computation
NuMVC: an efficient local search algorithm for minimum vertex cover
Journal of Artificial Intelligence Research
Decentralized constraint satisfaction
IEEE/ACM Transactions on Networking (TON)
Local search for Boolean Satisfiability with configuration checking and subscore
Artificial Intelligence
Hi-index | 0.00 |
The computational complexity of approximating omega (G), the size of the largest clique in a graph G, within a given factor is considered. It is shown that if certain approximation procedures exist, then EXPTIME=NEXPTIME and NP=P.