A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
An Efficient Algorithm for Graph Isomorphism
Journal of the ACM (JACM)
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
Journal of the ACM (JACM)
Formal languages and their relation to automata
Formal languages and their relation to automata
Algebraic Structures with Hard Equivalence and Minimization Problems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Communications of the ACM
A complexity theory based on Boolean algebra
Journal of the ACM (JACM)
Feedback vertex sets and cyclically reducible graphs
Journal of the ACM (JACM)
Database partitioning in a cluster of processors
ACM Transactions on Database Systems (TODS)
Experiments with a generic reduction computer
ACM SIGACT News
Private coins versus public coins in interactive proof systems
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The complexity of optimization problems
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
NP is as easy as detecting unique solutions
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Minimal degrees for polynomial reducibilities
Journal of the ACM (JACM)
How to prove all NP-statements in zero-knowledge, and a methodology of cryptographic protocol design
Proceedings on Advances in cryptology---CRYPTO '86
Feasible arithmetic computations: Valiant's hypothesis
Journal of Symbolic Computation
Data allocation in distributed database systems
ACM Transactions on Database Systems (TODS)
Many hard examples for resolution
Journal of the ACM (JACM)
Optimization, approximation, and complexity classes
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Stratification and knowledge base management
Journal of Symbolic Computation
A Note on Nondeterminism in Small, Fast Parallel Computers
IEEE Transactions on Computers
On the theory of average case complexity
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Nondeterministic polynomial-time computations and models of arithmetic
Journal of the ACM (JACM)
Computational Complexity of Controllability/Observability Problems for Combinational Circuits
IEEE Transactions on Computers
The complexity of equivalence for commutative rings
Journal of Symbolic Computation
Extended Horn sets in propositional logic
Journal of the ACM (JACM)
Integral equations, systems of quadratic equations, and exponential time completeness
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Checking computations in polylogarithmic time
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Proceedings of the 1990 ACM/IEEE conference on Supercomputing
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Journal of the ACM (JACM)
On the concrete complexity of zero-knowledge proofs
CRYPTO '89 Proceedings on Advances in cryptology
Zero knowledge proofs of knowledge in two rounds
CRYPTO '89 Proceedings on Advances in cryptology
The history and status of the P versus NP question
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Robust trainability of single neurons
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Efficient local search for very large-scale satisfiability problems
ACM SIGART Bulletin
On the approximation of maximum satisfiability
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
The membership problem in aperiodic transformation monoids
Journal of the ACM (JACM)
Traffic Routing for Multicomputer Networks with Virtual Cut-Through Capability
IEEE Transactions on Computers
Asynchronous organizations for multi-algorithm problems
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
A taxonomy of proof systems (part 2)
ACM SIGACT News
Simple characterizations of P(#P) and complete problems
Journal of Computer and System Sciences
A taxonomy of complexity classes of functions
Journal of Computer and System Sciences
On Polynomial-Time Testable Combinational Circuits
IEEE Transactions on Computers
Optimal Centralized Algorithms for Store-And-Forward Deadlock Avoidance
IEEE Transactions on Computers
Turing Award lecture: it's time to reconsider time
Communications of the ACM
The quasilinear isomorphism challenge
ACM SIGACT News
On the complexity of dataflow analysis of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
A New Public-Key Cipher System Based Upon the Diophantine Equations
IEEE Transactions on Computers
Database metatheory: asking the big queries
ACM SIGACT News
Database metatheory: asking the big queries
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Knowledge compilation and theory approximation
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Modular coloring formulas are hard for cutting planes proofs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
The Unison algorithm: fast evaluation of Boolean expressions
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Strategic directions in research in theory of computing
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
WSC '85 Proceedings of the 17th conference on Winter simulation
A divide-and-conquer approach for asynchronous interface synthesis
ISSS '94 Proceedings of the 7th international symposium on High-level synthesis
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Probabilistic checking of proofs: a new characterization of NP
Journal of the ACM (JACM)
Complexity of answering queries using materialized views
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
NP might not be as easy as detecting unique solutions
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Finding almost-satisfying assignments
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Deadlock-free routing in arbitrary networks via the flattest common supersequence method
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Local search for statistical counting
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Minimizing time-space cost for database version control
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A massively-parallel easily-scalable satisfiability solver using reconfigurable hardware
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Machine Learning
Learning to Reason with a Restricted View
Machine Learning
Adaptive information system design: one query at a time
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Efficient optimization of a class of relational expressions
ACM Transactions on Database Systems (TODS)
Computing Partitions with Applications to the Knapsack Problem
Journal of the ACM (JACM)
A Formal Construction of Term Classes
Journal of the ACM (JACM)
On the Structure of Polynomial Time Reducibility
Journal of the ACM (JACM)
On Reducibility to Complex or Sparse Sets
Journal of the ACM (JACM)
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
Journal of the ACM (JACM)
Optimal Code Generation for Expression Trees
Journal of the ACM (JACM)
Code Generation for a One-Register Machine
Journal of the ACM (JACM)
P-Complete Approximation Problems
Journal of the ACM (JACM)
A Combinatorial Problem Which Is Complete in Polynomial Space
Journal of the ACM (JACM)
The Complexity of Trie Index Construction
Journal of the ACM (JACM)
Complexity of Synthesizing Inductive Assertions
Journal of the ACM (JACM)
Renaming a Set of Clauses as a Horn Set
Journal of the ACM (JACM)
Satisfiability Is Quasilinear Complete in NQL
Journal of the ACM (JACM)
The Complexity of Some Problems on Subsequences and Supersequences
Journal of the ACM (JACM)
On the Tape Complexity of Deterministic Context-Free Languages
Journal of the ACM (JACM)
Approximation Algorithms for Some Postman Problems
Journal of the ACM (JACM)
An NP-Complete Number-Theoretic Problem
Journal of the ACM (JACM)
The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Complexity of Partial Satisfaction
Journal of the ACM (JACM)
The Complexity of the Equivalence Problem for Simple Programs
Journal of the ACM (JACM)
On the Complexity of Testing Implications of Functional and Join Dependencies
Journal of the ACM (JACM)
On the Complexity of Flowchart and Loop Program Schemes and Programming Languages
Journal of the ACM (JACM)
Relativized Questions Involving Probabilistic Algorithms
Journal of the ACM (JACM)
Useless Actions Make a Difference: Strict Serializability of Database Updates
Journal of the ACM (JACM)
Data compression via textual substitution
Journal of the ACM (JACM)
Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs
Journal of the ACM (JACM)
On the Simplification and Equivalence Problems for Straight-Line Programs
Journal of the ACM (JACM)
On the complexity of unique solutions
Journal of the ACM (JACM)
Parallel computing on personal computers
Proceedings of the 1986 ACM SIGSMALL/PC symposium on Small systems
Observations on the complexity of composable simulation
Proceedings of the 31st conference on Winter simulation: Simulation---a bridge to the future - Volume 1
Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Deterministic Processor Scheduling
ACM Computing Surveys (CSUR)
A Survey of Analysis Techniques for Discrete Algorithms
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Code Generation and Storage Allocation for Machines with Span-Dependent Instructions
ACM Transactions on Programming Languages and Systems (TOPLAS)
An overview of computational complexity
Communications of the ACM
Assembling code for machines with span-dependent instructions
Communications of the ACM
Synthesizing constraint expressions
Communications of the ACM
Communications of the ACM
Scheduling independent tasks to reduce mean finishing time
Communications of the ACM
Design and analysis of physical design algorithms
Proceedings of the 2001 international symposium on Physical design
Performance-driven multi-level clustering with application to hierarchical FPGA mapping
Proceedings of the 38th annual Design Automation Conference
Quantum computers that can be simulated classically in polynomial time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Statistical mechanics methods and phase transitions in optimizationproblems
Theoretical Computer Science - Phase transitions in combinatorial problems
Rigorous results for random (2 + p)-SAT
Theoretical Computer Science - Phase transitions in combinatorial problems
Results related to threshold phenomena research in satisfiability: lower bounds
Theoretical Computer Science - Phase transitions in combinatorial problems
Lower bounds for random 3-SAT via differential equations
Theoretical Computer Science - Phase transitions in combinatorial problems
Graph colourings and partitions
Theoretical Computer Science
Hardness and methods to solve CLIQUE
Journal of Computer Science and Technology
Hard examples for bounded depth frege
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Effort profiles in multi-agent resource allocation
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4
Parallel beta reduction is not elementary recursive
Information and Computation
A precise inter-procedural data flow algorithm
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
SIGACT news complexity theory column 34
ACM SIGACT News
The complexity of propositional linear temporal logics in simple cases
Information and Computation
The complexity of testing predicate locks
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Solving Satisfiability Problems Using Elliptic Approximations. A Note on Volumes and Weights
Annals of Mathematics and Artificial Intelligence
The complexity of evaluating relational queries
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Foundations for multifile design by application partitioning
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Analytic sets in descriptive set theory and NP sets in complexity theory
Fundamenta Informaticae
Annals of Mathematics and Artificial Intelligence
Boosting complete techniques thanks to local search methods
Annals of Mathematics and Artificial Intelligence
A Model-Based Diagnosis System for Identifying Faulty Components in Digital Circuits
Applied Intelligence
A SAT Solver Using Reconfigurable Hardware and Virtual Logic
Journal of Automated Reasoning
Relaxations of the Satisfiability Problem Using Semidefinite Programming
Journal of Automated Reasoning
The Propositional Formula Checker HeerHugo
Journal of Automated Reasoning
Resolution versus Search: Two Strategies for SAT
Journal of Automated Reasoning
Partial Instantiation Methods for Inference in First-Order Logic
Journal of Automated Reasoning
The Complexity Analysis of the Inverse Center Location Problem
Journal of Global Optimization
Cosmological lower bound on the circuit complexity of a small problem in logic
Journal of the ACM (JACM)
The importance of the P versus NP question
Journal of the ACM (JACM)
Separation of complexity classes
Journal of the ACM (JACM)
Why haven't more quantum algorithms been found?
Journal of the ACM (JACM)
Deterministic versus nondeterministic time and lower bound problems
Journal of the ACM (JACM)
Three problems in computer science
Journal of the ACM (JACM)
Evolutionary local-search with extremal optimization
Neural, Parallel & Scientific Computations
Nagging: a scalable fault-tolerant paradigm for distributed search
Artificial Intelligence
Efficient Combinational Verification Using Overlapping Local BDDs and a Hash Table
Formal Methods in System Design
On the Hamming distance of constraint satisfaction problems
Theoretical Computer Science - Complexity and logic
On an optimal propositional proof system and the structure of easy subsets of TAUT
Theoretical Computer Science - Complexity and logic
A Tutorial on Stålmarck‘s Proof Procedure for PropositionalLogic
Formal Methods in System Design - Special issue on formal methods for computer-added design
The Automation of Proof: A Historical and Sociological Exploration
IEEE Annals of the History of Computing
Computational Complexity for Physicists
Computing in Science and Engineering
Solution of Switching Equations Based on a Tabular Algebra
IEEE Transactions on Computers
Convergence Properties of Optimization Algorithms for the SAT Problem
IEEE Transactions on Computers
IEEE Transactions on Knowledge and Data Engineering
Global Optimization for Satisfiability (SAT) Problem
IEEE Transactions on Knowledge and Data Engineering
Information Source Tracking Method: Efficiency Issues
IEEE Transactions on Knowledge and Data Engineering
Property testers for dense constraint satisfaction programs on finite domains
Random Structures & Algorithms
Complexity of finding dense subgraphs
Discrete Applied Mathematics
A complete problem for statistical zero knowledge
Journal of the ACM (JACM)
Evolutionary algorithms for the satisfiability problem
Evolutionary Computation
Large scale reconstruction of haplotypes from genotype data
RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
Independent domination and matchings in graphs
Discrete Mathematics
A spectral technique for random satisfiable 3CNF formulas
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A Comparative Analysis of Dependence Testing Mechanisms
LCPC '00 Proceedings of the 13th International Workshop on Languages and Compilers for Parallel Computing-Revised Papers
Database Partitioning in a Cluster of Processors
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Structural Complexity and Neural Networks
WIRN VIETRI 2002 Proceedings of the 13th Italian Workshop on Neural Nets-Revised Papers
Modelling More Realistic SAT Problems
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Managing Schemata for Semistructured Databases Using Constraints
ADBIS-DASFAA '00 Proceedings of the East-European Conference on Advances in Databases and Information Systems Held Jointly with International Conference on Database Systems for Advanced Applications: Current Issues in Databases and Information Systems
The Complexity of Computing the Size of an Interval
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Constraint Satisfaction Problems in Non-deterministic Logarithmic Space
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Multiagent SAT (MASSAT): Autonomous Pattern Search in Constrained Domains
IDEAL '02 Proceedings of the Third International Conference on Intelligent Data Engineering and Automated Learning
The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Reverse Center Location Problem
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
On the Expressibility of Stable Logic Programming
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
On the Complexity of Model Checking and Inference in Minimal Models
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
The Complexity of Copy Constant Detection in Parallel Programs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Crptograpic Applications of the Non-Interactive Metaproof and Many-Prover Systems
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Theta2p-Completeness: A Classical Approach for New Results
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Optimization Problems Categories
Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
Stability of Approximation Algorithms for Hard Optimization Problems
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Exploiting Partial Knowledge of Satisfying Assignments
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Automatic Generation of Implied Clauses for SAT
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Timed Verification of Asynchronous Circuits
Concurrency and Hardware Design, Advances in Petri Nets
Measuring the Spatial Dispersion of Evolutionary Search Processes: Application to Walksat
Selected Papers from the 5th European Conference on Artificial Evolution
SAT, Local Search Dynamics and Density of States
Selected Papers from the 5th European Conference on Artificial Evolution
Comparing the Expressive Powers of Some Syntactically Restricted Classes of Logic Programs
CL '00 Proceedings of the First International Conference on Computational Logic
Finding Tractable Formulas in NNF
CL '00 Proceedings of the First International Conference on Computational Logic
On the Hardness of Recognizing Bundles in Time Table Graphs
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
The Quest for Efficient Boolean Satisfiability Solvers
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Approximating SVPinfty to within Almost-Polynomial Factors Is NP-Hard
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Length-bounded disjoint paths in planar graphs
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Non-standard approaches to integer programming
Discrete Applied Mathematics
Three theses of representation in the semantic web
WWW '03 Proceedings of the 12th international conference on World Wide Web
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
A Virtual Logic Algorithm for Solving Satisfiability Problems Using Reconfigurable Hardware
FCCM '99 Proceedings of the Seventh Annual IEEE Symposium on Field-Programmable Custom Computing Machines
Edge-deletion and edge-contraction problems
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
DAC '81 Proceedings of the 18th Design Automation Conference
Examples of hard tautologies in the propositional calculus
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
A characterization of the class of functions computable in polynomial time on Random Access Machines
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Bandwidth constrained NP-Complete problems
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
The complexity of dynamic languages and dynamic optimization problems
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Computer aided design of microprocessor-based systems
DAC '78 Proceedings of the 15th Design Automation Conference
Fast probabilistic algorithms for hamiltonian circuits and matchings
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Graph isomorphism, general remarks
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Reducibility, randomness, and intractibility (Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Complexity of finitely presented algebras
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Computations with a restricted number of nondeterministic steps (Extended Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Polynomial reducibilities and upward diagonalizations
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Efficient reducibility between programming systems (Preliminary Report)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
NP-complete decision problems for quadratic polynomials
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
On isomorphisms and density of NP and other complete sets
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
A combinatorial problem which is complete in polynomial space
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
On the validity and complexity of bounded resolution
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Feasibly constructive proofs and the propositional calculus (Preliminary Version)
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Optimal code generation for expression trees
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Riemann's Hypothesis and tests for primality
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Complete problems for deterministic polynomial time
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Some simplified NP-complete problems
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Polynomial and abstract subrecursive classes
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Comparison of polynomial-time reducibilities
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
On the lengths of proofs in the propositional calculus (Preliminary Version)
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Structure of complexity in the weak monadic second-order theories of the natural numbers
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
On some generalizations of binary search
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
On the time and tape complexity of languages I
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
An observation on time-storage trade off
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Approximation algorithms for combinatorial problems
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Type two computational complexity
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Complete register allocation problems
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Computer Science And Recursion Theory
ACM '78 Proceedings of the 1978 annual conference
ACM '78 Proceedings of the 1978 annual conference
The macro model for data compression (Extended Abstract)
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
An NP-complete number-theoretic problem
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
On the completeness of a generalized matching problem
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Node-and edge-deletion NP-complete problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Nondeterminism and the size of two way finite automata
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Relativized questions involving probabilistic algorithms
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The complexity of the equivalence problem for counter machines, semilinear sets, and simple programs
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Completeness classes in algebra
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
On &ggr;-reducibility versus polynomial time many-one reducibility(Extended Abstract)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Lower bounds on the size of sweeping automata
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Complexity theory and design automation
DAC '80 Proceedings of the 17th Design Automation Conference
The complexity of the equivalence problem for straight-line programs
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Turing machines and the spectra of first-order formulas with equality
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Polynomial complete scheduling problems
SOSP '73 Proceedings of the fourth ACM symposium on Operating system principles
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Some structural properties of polynomial reducibilities and sets in NP
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
An artwork design verification system
DAC '75 Proceedings of the 12th Design Automation Conference
Classes of pebble games and complete problems
ACM '78 Proceedings of the 1978 annual conference - Volume 2
Scheduling independent processors with different storage capacities
ACM '74 Proceedings of the 1974 annual conference - Volume 1
Toward models for probabilistic program correctness
Proceedings of the software quality assurance workshop on Functional and performance issues
Studying the Complexity of Global Verification for NP-Hard Discrete Optimization Problems
Journal of Global Optimization
Journal of Algorithms
Fast algorithms for revision of some special propositional knowledge bases
Journal of Computer Science and Technology
SIGACT news complexity theory column 40
ACM SIGACT News
Resolution and binary decision diagrams cannot simulate each other polynomially
Discrete Applied Mathematics - The renesse issue on satisfiability
Equivalent literal propagation in the DLL procedure
Discrete Applied Mathematics - The renesse issue on satisfiability
Geometry of deduction via graphs of proofs
Logic for concurrency and synchronisation
Information and Computation
Improving a fixed parameter tractability time bound for the shadow problem
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
On characterizations of the basic feasible functionals, Part I
Journal of Functional Programming
Mathematical modal logic: a view of its evolution
Journal of Applied Logic
Pancakes, puzzles, and polynomials: cracking the Cracker Barrel
ACM SIGACT News
Investigation of Maximum and Minimum Satisfiability Problems Using L-Partition
Automation and Remote Control
Validation and verification of knowledge-based systems: report on EUROVAV99
The Knowledge Engineering Review
3-Colorability ∈ P for P6-free graphs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Precise interprocedural dependence analysis of parallel programs
Theoretical Computer Science
Hard examples for the bounded depth Frege proof system
Computational Complexity
On the expressibility of stable logic programming
Theory and Practice of Logic Programming
A quantifier characterization for nondeterministic log space
ACM SIGACT News
A clique problem equivalent to graph isomorphism
ACM SIGACT News
On non-erasing oracle tapes in space bounded reducibility
ACM SIGACT News
A characterization of log-space computable functions
ACM SIGACT News
Two results on polynomial-time reducibilities
ACM SIGACT News
A note on complete sets for the polynomial-time hierarchy
ACM SIGACT News
Satisfiability and integer programming as complementary tools
Proceedings of the 2004 Asia and South Pacific Design Automation Conference
Increasing Internet Capacity Using Local Search
Computational Optimization and Applications
Reconfigurable Hardware SAT Solvers: A Survey of Systems
IEEE Transactions on Computers
Knowledge and efficient computation
TARK '86 Proceedings of the 1986 conference on Theoretical aspects of reasoning about knowledge
Progress in Quantum Algorithms
Quantum Information Processing
Counting for Satisfiability by Inverting Resolution
Artificial Intelligence Review
Solving the Resolution-Free SAT Problem by Submodel Propagation in Linear Time
Annals of Mathematics and Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
Approximation algorithms for the optimal p-source communication spanning tree
Discrete Applied Mathematics
Polynomial transformations and data-independent neighborhood functions
Discrete Applied Mathematics
Modelling legal reasoning in a mathematical environment through model theoretic semantics
ICAIL '03 Proceedings of the 9th international conference on Artificial intelligence and law
GridSAT: A Chaff-based Distributed SAT Solver for the Grid
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
Tantrix TM rotation puzzles are intractable
Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
A Distributed Chained Lin-Kernighan Algorithm for TSP Problems
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
A new tractable class of constraint satisfaction problems
Annals of Mathematics and Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
Beyond NP: the work and legacy of Larry Stockmeyer
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Hierarchies for semantic classes
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Every 2-CSP allows nontrivial approximation
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The equivalence of theorem proving and the interconnection problem
ACM SIGDA Newsletter
A Parallelization Scheme Based on Work Stealing for a Class of SAT Solvers
Journal of Automated Reasoning
The helly property on subfamilies of limited size
Information Processing Letters
Recursion schemata for slowly growing depth circuit classes
Computational Complexity
Mechanism design for software agents with complete information
Decision Support Systems - Special issue: Decision theory and game theory in agent design
Advanced models of cellular genetic algorithms evaluated on SAT
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
PASSAT: Efficient SAT-Based Test Pattern Generation for Industrial Circuits
ISVLSI '05 Proceedings of the IEEE Computer Society Annual Symposium on VLSI: New Frontiers in VLSI Design
A new look at survey propagation and its generalizations
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Encyclopedia of Computer Science
MaxSolver: an efficient exact algorithm for (weighted) maximum satisfiability
Artificial Intelligence
A computationally grounded logic of knowledge, belief and certainty
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
The impact of complexity theory on algorithms for sparse polynomials
ACM SIGSAM Bulletin
On the complexity of buffer allocation in message passing systems
Journal of Parallel and Distributed Computing
Properties of uniformly hard languages
Information Processing Letters
Empirical Modelling of Genetic Algorithms
Evolutionary Computation
A Genetic Model: Analysis and Application to MAXSAT
Evolutionary Computation
Solving random satisfiable 3CNF formulas in expected polynomial time
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Generating all vertices of a polyhedron is hard
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Efficient initial solution to extremal optimization algorithm for weighted MAXSAT problem
IEA/AIE'2003 Proceedings of the 16th international conference on Developments in applied artificial intelligence
Graph indexing based on discriminative frequent structure analysis
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
New tractable classes for default reasoning from conditional knowledge bases
Annals of Mathematics and Artificial Intelligence
Memorization and Association on a Realistic Neural Model
Neural Computation
On the Nonlearnability of a Single Spiking Neuron
Neural Computation
Threshold values of random K-SAT from the cavity method
Random Structures & Algorithms
Typical case complexity of satisfiability algorithms and the threshold phenomenon
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
NP-completeness for all computer science undergraduates: a novel project-based curriculum
Journal of Computing Sciences in Colleges
An effective heuristic algorithm for the maximum satisfiability problem
Applied Intelligence
Locally consistent constraint satisfaction problems
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
APX-hardness of domination problems in circle graphs
Information Processing Letters
Satgraphs and independent domination: part 1
Theoretical Computer Science
Independent domination in hereditary classes
Theoretical Computer Science
Progress in computational complexity theory
Journal of Computer Science and Technology
Algorithmic construction of sets for k-restrictions
ACM Transactions on Algorithms (TALG)
Methods and limitations of security policy reconciliation
ACM Transactions on Information and System Security (TISSEC)
Reasoning about obfuscated private information: who have lied and how to lie
Proceedings of the 5th ACM workshop on Privacy in electronic society
A value-based argument model of convention degradation
Artificial Intelligence and Law - Argumentation in artificial intelligence and law
GRASP with path relinking for the weighted MAXSAT problem
Journal of Experimental Algorithmics (JEA)
On the maximum satisfiability of random formulas
Journal of the ACM (JACM)
A computational model for RNA multiple structural alignment
Theoretical Computer Science
Quantum cooperative search algorithm for 3-SAT
Journal of Computer and System Sciences
Note: Computational complexity of some restricted instances of 3-SAT
Discrete Applied Mathematics
A competitive and cooperative approach to propositional satisfiability
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
GridSAT: a system for solving satisfiability problems using a computational grid
Parallel Computing - Optimization on grids - Optimization for grids
Evolving combinatorial problem instances that are difficult to solve
Evolutionary Computation
Exact sat-based toffoli network synthesis
Proceedings of the 17th ACM Great Lakes symposium on VLSI
Reducing verification overhead with RTL slicing
Proceedings of the 17th ACM Great Lakes symposium on VLSI
Hybrid commitments and their applications to zero-knowledge proof systems
Theoretical Computer Science
Stochastic local search for incremental SAT
International Journal of Knowledge-based and Intelligent Engineering Systems
Local and global deadlock-detection in component-based systems are NP-hard
Information Processing Letters
INFORMS Journal on Computing
Core Stability of Minimum Coloring Games
Mathematics of Operations Research
Maintenance Routing for Train Units: The Transition Model
Transportation Science
Fg-index: towards verification-free query processing on graph databases
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
A new look at survey propagation and its generalizations
Journal of the ACM (JACM)
A new hybrid solution to boost SAT solver performance
Proceedings of the conference on Design, automation and test in Europe
Exploiting partial knowledge of satisfying assignments
Discrete Applied Mathematics
Exact combinatorial optimization methods for physical design of regular logic bricks
Proceedings of the 44th annual Design Automation Conference
Using SAT-based techniques in power estimation
Microelectronics Journal
Correlation search in graph databases
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
ACM Turing award lectures
An overview of computational complexity
ACM Turing award lectures
Turing award lecture: it's time to reconsider time
ACM Turing award lectures
Quantum Algorithms: Philosophical Lessons
Minds and Machines
Visualizing SAT Instances and Runs of the DPLL Algorithm
Journal of Automated Reasoning
Equivalence among relational expressions with the union and difference operation
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
Processing conjunctive predicates and queries
VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6
Characterization and recognition of generalized clique-Helly graphs
Discrete Applied Mathematics
Tours of Graphs, Digraphs, and Sequential Machines
IEEE Transactions on Computers
Polynomially Complete Fault Detection Problems
IEEE Transactions on Computers
On Minimal Test Sets for Locating Single Link Failures in Networks
IEEE Transactions on Computers
The Complexity of Fault Detection Problems for Combinational Logic Circuits
IEEE Transactions on Computers
Distributed Enumeration on Between Computers
IEEE Transactions on Computers
The Complexity of Horizontal Word Encoding in Microprogrammed Machines
IEEE Transactions on Computers
On the Computational Complexity of System Diagnosis
IEEE Transactions on Computers
State Reduction in Incompletely Specified Finite-State Machines
IEEE Transactions on Computers
Solving Computation Slicing Using Predicate Detection
IEEE Transactions on Parallel and Distributed Systems
Extended resolution simulates binary decision diagrams
Discrete Applied Mathematics
Complexity results for three-dimensional orthogonal graph drawing
Journal of Discrete Algorithms
Pairs of SAT-assignments in random Boolean formulæ
Theoretical Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
An algorithm for computing theory prime implicates in first order logic
International Journal of Information and Communication Technology
An improved lower bound for approximating minimum GCD multiplier in l∞ norm (GCDM∞)
Theoretical Computer Science
Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs
Journal of Discrete Algorithms
Haplotyping for Disease Association: A Combinatorial Approach
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Infeasibility of instance compression and succinct PCPs for NP
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Towards an optimal separation of space and length in resolution
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
A Tabu history driven crossover operator design for memetic algorithm applied to Max-2SAT-problems
Proceedings of the 10th annual conference on Genetic and evolutionary computation
A pseudo-Boolean consensus approach to nonlinear 0-1 optimization
Discrete Applied Mathematics
A search agent for a Max-2sat memetic algorithm approach
ACACOS'08 Proceedings of the 7th WSEAS International Conference on Applied Computer and Applied Computational Science
Computational Complexity of Constraint Satisfaction
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Eliminating Redundant Clauses in SAT Instances
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
NP-Completeness of (k-SAT,r-UNk-SAT) and (LSAT ≥ k,r-UNLSAT ≥ k)
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Some Theorems Concerning the Core Function
Concurrency, Graphs and Models
Theorem Proving for Verification (Invited Tutorial)
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Language and Automata Theory and Applications
A Compass to Guide Genetic Algorithms
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Various Aspects of Finite Quantum Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
A New Quantum Evolutionary Local Search Algorithm for MAX 3-SAT Problem
HAIS '08 Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems
WSEAS Transactions on Computers
Probabilistically checkable proofs
Communications of the ACM - Being Human in the Digital Age
Bounds on multiprocessing anomalies and related packing algorithms
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
The Complexity of Satisfiability for Fragments of CTL and CTL*;
Electronic Notes in Theoretical Computer Science (ENTCS)
A comparative runtime analysis of heuristic algorithms for satisfiability problems
Artificial Intelligence
Strength Two Covering Arrays Construction Using a SAT Representation
MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
A Global Filtration for Satisfying Goals in Mutual Exclusion Networks
Recent Advances in Constraints
FPGA-based hardware acceleration for Boolean satisfiability
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Complexity classes for self-assembling flexible tiles
Theoretical Computer Science
Journal of Experimental Algorithmics (JEA)
Graphical Models, Exponential Families, and Variational Inference
Foundations and Trends® in Machine Learning
Note: On the inapproximability of independent domination in 2P3-free perfect graphs
Theoretical Computer Science
Novel job based and machine based lower bound on makespan in jobshop scheduling problem
ISTASC'08 Proceedings of the 8th conference on Systems theory and scientific computation
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?
Complexity of Constraints
Designing Visual Languages for Description Logics
Journal of Logic, Language and Information
Efficient query processing on graph databases
ACM Transactions on Database Systems (TODS)
G-hash: towards fast kernel-based similarity search in large graph databases
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Optimal constraint-preserving netlist simplification
Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
Discrete Applied Mathematics
Proceedings of the 2009 ACM symposium on Applied Computing
On the complexity of graph cuboidal dual problems for 3-D floorplanning of integrated circuit design
Proceedings of the 19th ACM Great Lakes symposium on VLSI
A deterministic reduction for the gap minimum distance problem: [extended abstract]
Proceedings of the forty-first annual ACM symposium on Theory of computing
Boolean satisfiability from theoretical hardness to practical success
Communications of the ACM - A Blind Person's Interaction with Technology
Quantifying inefficiency in cost-sharing mechanisms
Journal of the ACM (JACM)
Formalization and Implementation of Modern SAT Solvers
Journal of Automated Reasoning
Satisfiability Parsimoniously Reduces to the Tantrix™ Rotation Puzzle Problem
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Structural differences between two graphs through hierarchies
Proceedings of Graphics Interface 2009
ACM SIGACT News
The status of the P versus NP problem
Communications of the ACM - The Status of the P versus NP Problem
Boolean Constraints for XML Modeling
Proceedings of the 2009 conference on Information Modelling and Knowledge Bases XX
Tricolorable torus knots are NP-complete
Proceedings of the 47th Annual Southeast Regional Conference
A Novel Approach to Combine a SLS- and a DPLL-Solver for the Satisfiability Problem
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Building a Hybrid SAT Solver via Conflict-Driven, Look-Ahead and XOR Reasoning Techniques
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Instance-Based Selection of Policies for SAT Solvers
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Fast simplifications for Tarski formulas
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Automated deduction for verification
ACM Computing Surveys (CSUR)
Transforming SAT into Termination of Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Floodlight illumination of infinite wedges
Computational Geometry: Theory and Applications
The concept of nondeterminism: its development and implications for teaching
ACM SIGCSE Bulletin
Complexity of contextual reasoning
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Towards efficient sampling: exploiting random walk strategies
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Constraint acquisition for Entity-Relationship models
Data & Knowledge Engineering
Compact E-Cash and Simulatable VRFs Revisited
Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
Backbones and backdoors in satisfiability
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Backbone fragility and the local search cost peak
Journal of Artificial Intelligence Research
Space efficiency of propositional knowledge representation formalisms
Journal of Artificial Intelligence Research
Generalizing Boolean satisfiability I: background and survey of existing work
Journal of Artificial Intelligence Research
A complete classification of tractability in RCC-5
Journal of Artificial Intelligence Research
Heuristics based on unit propagation for satisfiability problems
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
A guide to the modal logics of knowledge and belief: preliminary draft
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Knowledge compilation using theory prime implicates
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
On problems without polynomial kernels
Journal of Computer and System Sciences
Information and Computation
On the random satisfiable process
Combinatorics, Probability and Computing
A simplifier for propositional formulas with many binary clauses
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Propositional abduction is almost always hard
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Predicting Effectiveness of Automatic Testing Tools
ASE '08 Proceedings of the 2008 23rd IEEE/ACM International Conference on Automated Software Engineering
Time-dependent multi-scheduling of multicast
ACM Transactions on Algorithms (TALG)
SAT-Solving in Practice, with a Tutorial Example from Supervisory Control
Discrete Event Dynamic Systems
MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
Artificial Intelligence
Exact multiple-control toffoli network synthesis with SAT techniques
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Non-conservative extension of a peer in a P2P inference system
AI Communications
Exclusive and essential sets of implicates of Boolean functions
Discrete Applied Mathematics
Multidimensional bin packing algorithms
IBM Journal of Research and Development
PN code acquisition using Boolean satisfiability techniques
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Multi-tenant solution for IT service management: a quantitative study of benefits
IM'09 Proceedings of the 11th IFIP/IEEE international conference on Symposium on Integrated Network Management
Extreme compass and dynamic multi-armed bandits for adaptive operator selection
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
ISICA '09 Proceedings of the 4th International Symposium on Advances in Computation and Intelligence
An Optical Wavelength-Based Solution to the 3-SAT Problem
OSC '09 Proceedings of the 2nd International Workshop on Optical SuperComputing
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Solving satisfiability in less than 2n steps
Discrete Applied Mathematics
Typical case complexity of Satisfiability Algorithms and the threshold phenomenon
Discrete Applied Mathematics
A collaborative approach for multi-threaded SAT solving
International Journal of Parallel Programming
Properties of uniformly hard languages
Information Processing Letters
The Helly property on subfamilies of limited size
Information Processing Letters
APX-hardness of domination problems in circle graphs
Information Processing Letters
Information Sciences: an International Journal
Construction of constrained codes for state-independent decoding
IEEE Journal on Selected Areas in Communications
Relaxed survey propagation for the weighted maximum satisfiability problem
Journal of Artificial Intelligence Research
A genetic distance metric to discriminate the selection of algorithms for the general ATSP problem
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
Restricting backtracking in connection calculi
AI Communications - Practical Aspects of Automated Reasoning
Riemann's hypothesis and tests for primality
Journal of Computer and System Sciences
A hierarchy for nondeterministic time complexity
Journal of Computer and System Sciences
NP-complete scheduling problems
Journal of Computer and System Sciences
Polynomial and abstract subrecursive classes
Journal of Computer and System Sciences
A characterization of the power of vector machines
Journal of Computer and System Sciences
On the equivalence, containment, and covering problems for the regular and context-free languages
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Space-bounded reducibility among combinatorial problems
Journal of Computer and System Sciences
Complexity-class-encoding sets
Journal of Computer and System Sciences
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
An observation on time-storage trade off
Journal of Computer and System Sciences
Fast algorithms for bin packing
Journal of Computer and System Sciences
Complexity of propositional proofs under a promise
ACM Transactions on Computational Logic (TOCL)
The computational complexity of equivalence and isomorphism problems
The computational complexity of equivalence and isomorphism problems
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
The traveling salesman: computational solutions for TSP applications
The traveling salesman: computational solutions for TSP applications
Decision-making coordination and efficient reasoning techniques for feature-based configuration
Science of Computer Programming
Decorrelating wireless sensor network traffic to inhibit traffic analysis attacks
Pervasive and Mobile Computing
SAT-based analysis of feature models is easy
Proceedings of the 13th International Software Product Line Conference
Finding models for blocked 3-SAT problems in linear time by systematical refinement of a sub-model
KI'06 Proceedings of the 29th annual German conference on Artificial intelligence
On the complexity of higher-order matching in the linear λ-calculus
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
The complexity of generalized satisfiability for linear temporal logic
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Strengthening zero-knowledge protocols using signatures
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Solving multi-objective pseudo-boolean problems
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Formalizing dangerous SAT encodings
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Algorithms for variable-weighted 2-SAT and dual problems
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Minimum 2CNF resolution refutations in polynomial time
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Vertex cover approximations on random graphs
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Ant colony optimization with adaptive fitness function for satisfiability testing
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
Solving difficult SAT instances using greedy clique decomposition
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Alternating states for dual nondeterminism in imperative programming
Theoretical Computer Science
Satisfiability parsimoniously reduces to the Tantrix™ rotation puzzle problem
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Cryptography with constant input locality
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
A CNF formula hierarchy over the hypercube
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
The deduction theorem for strong propositional proof systems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Satisfiability of algebraic circuits over sets of natural numbers
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Boolean satisfiability on a graphics processor
Proceedings of the 20th symposium on Great lakes symposium on VLSI
Golden ratio annealing for satisfiability problems using dynamically cooling schemes
ISMIS'08 Proceedings of the 17th international conference on Foundations of intelligent systems
Automated analysis of feature models 20 years later: A literature review
Information Systems
On multi-threaded satisfiability solving with OpenMP
IWOMP'08 Proceedings of the 4th international conference on OpenMP in a new era of parallelism
Complexity and algorithms for well-structured k-SAT instances
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Qualitative spatial reasoning with topological information
Qualitative spatial reasoning with topological information
Determining whether a simplicial 3-complex collapses to a 1-complex is NP-complete
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Inc*: an incremental approach for improving local search heuristics
EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
Solving graph coloring problems using learning automata
EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
Prototypes for automated architectural 3D-layout
VSMM'07 Proceedings of the 13th international conference on Virtual systems and multimedia
Modeling alternatives in exception executions
BPM'07 Proceedings of the 2007 international conference on Business process management
JPMiner: mining frequent jump patterns from graph databases
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 5
Formal Correctness Proof for DPLL Procedure
Informatica
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
Proceedings of the forty-second ACM symposium on Theory of computing
GBLENDER: towards blending visual query formulation and query processing in graph databases
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Combining finite learning automata with GSAT for the satisfiability problem
Engineering Applications of Artificial Intelligence
A note on disjunctive form tautologies
ACM SIGACT News
Satisfiability of algebraic circuits over sets of natural numbers
Discrete Applied Mathematics
Analysis of whole-book recognition
DAS '10 Proceedings of the 9th IAPR International Workshop on Document Analysis Systems
Scalable formula decomposition for propositional satisfiability
Proceedings of the Third C* Conference on Computer Science and Software Engineering
IEEE Transactions on Information Theory
Complexity of 3-D floorplans by analysis of graph cuboidal dual hardness
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Parametric quantified SAT solving
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Interactive searching and visualization of patterns in attributed graphs
Proceedings of Graphics Interface 2010
On the NP-ardness of blocks world
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 2
Negation and proof by contradiction in access-limited logic
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 2
Knowledge compilation using horn approximations
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 2
Efficient propositional constraint propagation
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
A new method for solving hard satisfiability problems
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Solving constraint satisfaction problems using finite state automata
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Hard and easy distributions of SAT problems
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Forming concepts for fast inference
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Towards an understanding of hill-climbing procedures for SAT
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Model-theoretic semantics and tractable algorithm for CNF-BCP
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
On the Polya permanent problem over finite fields
European Journal of Combinatorics
Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL
Theoretical Computer Science
Generating meta-heuristic optimization code using ADATE
Journal of Heuristics
Cryptographic and physical zero-knowledge proof: from Sudoku to nonogram
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Basic notions in computational complexity
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Parallel computation: models and complexity issues
Algorithms and theory of computation handbook
DSI: a method for indexing large graphs using distance set
WAIM'10 Proceedings of the 11th international conference on Web-age information management
Heuristics for planning with SAT
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
Journal of Computer and System Sciences
Holographic algorithms: From art to science
Journal of Computer and System Sciences
Hardness amplification within NP against deterministic algorithms
Journal of Computer and System Sciences
Infeasibility of instance compression and succinct PCPs for NP
Journal of Computer and System Sciences
Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Integration, the VLSI Journal
Approximate model-based diagnosis using greedy stochastic search
Journal of Artificial Intelligence Research
Contextual reasoning is NP-complete
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
Journal of Experimental Algorithmics (JEA)
Resource provisioning in SLA-based cluster computing
JSSPP'10 Proceedings of the 15th international conference on Job scheduling strategies for parallel processing
Graph transformation units guided by a sat solver
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Improving resource-unaware SAT solvers
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
A refuted conjecture on probabilistic satisfiability
SBIA'10 Proceedings of the 20th Brazilian conference on Advances in artificial intelligence
A new artificial immune system for solving the maximum satisfiability problem
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part II
An effective algorithm for and phase transitions of the directed hamiltonian cycle problem
Journal of Artificial Intelligence Research
A logic based algorithm for solving probabilistic satisfiability
IBERAMIA'10 Proceedings of the 12th Ibero-American conference on Advances in artificial intelligence
On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
SIAM Journal on Computing
An expressive mechanism for auctions on the web
Proceedings of the 20th international conference on World wide web
Nonlinear revision control for images
ACM SIGGRAPH 2011 papers
The Quadrupel --A Model for Automating Intermediary Selection in Supply Chain Management
Proceedings of the 2011 conference on Information Modelling and Knowledge Bases XXII
Applying AI and incomplete solution principles to solve NP-hard problems in the real-time systems
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Finding reductions automatically
Fields of logic and computation
CIMMACS'07 Proceedings of the 6th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics
Distributed decision problems: the locality angle
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Neighborhood based fast graph search in large networks
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Satisfiability modulo theories: introduction and applications
Communications of the ACM
An edge-based framework for fast subgraph matching in a large graph
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Survey of polynomial transformations between NP-complete problems
Journal of Computational and Applied Mathematics
Statically-directed dynamic automated test generation
Proceedings of the 2011 International Symposium on Software Testing and Analysis
A parameter-less genetic algorithm with customized crossover and mutation operators
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Beyond unit propagation in SAT solving
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Two slightly-entangled NP-complete problems
Quantum Information & Computation
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
A Syntax-based approach to measuring the degree of inconsistency for belief bases
International Journal of Approximate Reasoning
Encoding OCL data types for SAT-based verification of UML/OCL models
TAP'11 Proceedings of the 5th international conference on Tests and proofs
Threshold behaviors of a random constraint satisfaction problem with exact phase transitions
Information Processing Letters
Notes on Levin's theory of average-case complexity
Studies in complexity and cryptography
Average case complexity, revisited
Studies in complexity and cryptography
Nanotechnology based optical solution for NP-hard problems
OSC'10 Proceedings of the Third international conference on Optical supercomputing
Experimental study of the shortest reset word of random automat
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Tight bounds on local search to approximate the maximum satisfiability problems
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Autonomous resolution based on DNA strand displacement
DNA'11 Proceedings of the 17th international conference on DNA computing and molecular programming
Exact incremental analysis of timed automata with an SMT-solver
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Exploitation as an inference problem
Proceedings of the 4th ACM workshop on Security and artificial intelligence
Journal of the ACM (JACM)
Most probable explanations in Bayesian networks: Complexity and tractability
International Journal of Approximate Reasoning
Cryptography in constant parallel time
Cryptography in constant parallel time
The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
The Complexity of Early Deciding Set Agreement
SIAM Journal on Computing
Model complexity vs. performance in the bayesian optimization algorithm
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Most Relevant Explanation: computational complexity and approximation methods
Annals of Mathematics and Artificial Intelligence
Mixtures of kikuchi approximations
ECML'06 Proceedings of the 17th European conference on Machine Learning
Enumeration reducibility with polynomial time bounds
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
A computational model for self-assembling flexible tiles
UC'05 Proceedings of the 4th international conference on Unconventional Computation
Zchaff2004: an efficient SAT solver
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
On the role definitions in and beyond cryptography
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
An analytic criterion for CSAT
Information Processing Letters
Boolean functions with a simple certificate for CNF complexity
Discrete Applied Mathematics
Solving parity games by a reduction to SAT
Journal of Computer and System Sciences
Completeness for parity problems
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Can quantum entanglement detection schemes improve search?
Quantum Information Processing
Satisfiability judgement under incomplete information
Transactions on Rough Sets XI
Alloy+HotCore: a fast approximation to unsat core
ABZ'10 Proceedings of the Second international conference on Abstract State Machines, Alloy, B and Z
Some observations on holographic algorithms
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Diversification and determinism in local search for satisfiability
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
On some weighted satisfiability and graph problems
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
The local lemma is tight for SAT
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Solving SAT problems with TA algorithms using constant and dynamic markov chains length
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
On the computational complexity of dynamic slicing problems for program schemas
Mathematical Structures in Computer Science - Programming Language Interference and Dependence
Using bees to solve a data-mining problem expressed as a max-sat one
IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
Applying reduction techniques to software functional requirement specifications
SAM'04 Proceedings of the 4th international SDL and MSC conference on System Analysis and Modeling
Logical analysis of hash functions
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Topology aware coloring of gene regulatory networks
Proceedings of the 2nd ACM Conference on Bioinformatics, Computational Biology and Biomedicine
A new blockmodeling based hierarchical clustering algorithm for web social networks
Engineering Applications of Artificial Intelligence
Deciding safety properties in infinite-state pi-calculus via behavioural types
Information and Computation
GRASP with path-relinking for the weighted maximum satisfiability problem
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Efficient and experimental meta-heuristics for MAX-SAT problems
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
On the complexity of hilbert’s 17th problem
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Characterization and recognition of generalized clique-helly graphs
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Programming for modular reconfigurable robots
Programming and Computing Software
Complexity of Data Dependence Problems for Program Schemas with Concurrency
ACM Transactions on Computational Logic (TOCL)
Temporal context lie detection and generation
SDM'06 Proceedings of the Third VLDB international conference on Secure Data Management
Algorithmics – is there hope for a unified theory?
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Model search: formalizing and automating constraint solving in MDE platforms
ECMFA'10 Proceedings of the 6th European conference on Modelling Foundations and Applications
An evolutionary local search algorithm for the satisfiability problem
TAINN'05 Proceedings of the 14th Turkish conference on Artificial Intelligence and Neural Networks
On teaching the basics of complexity theory
Theoretical Computer Science
Automatic test pattern generation
SFM'06 Proceedings of the 6th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems
Software protection through dynamic code mutation
WISA'05 Proceedings of the 6th international conference on Information Security Applications
Proceedings of the Seventh Annual Workshop on Cyber Security and Information Intelligence Research
Fast simplifications for Tarski formulas based on monomial inequalities
Journal of Symbolic Computation
On the integration of software testing and formal analysis
Empirical Software Engineering and Verification
A pattern-based approach for efficient query processing over RDF data
Transactions on Large-Scale Data- and Knowledge-Centered Systems V
The GCT program toward the P vs. NP problem
Communications of the ACM
Fast subgraph isomorphism detection for graph-based retrieval
ICCBR'11 Proceedings of the 19th international conference on Case-Based Reasoning Research and Development
The legacy of turing in numerical analysis
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Turing machines for dummies: why representations do matter
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
ASE '11 Proceedings of the 2011 26th IEEE/ACM International Conference on Automated Software Engineering
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Optimization of Shared High-Performance Reconfigurable Computing Resources
ACM Transactions on Embedded Computing Systems (TECS)
An exact tensor network for the 3SAT problem
Quantum Information & Computation
Survey A survey of computational complexity results in systems and control
Automatica (Journal of IFAC)
Network-theoretic classification of parallel computation patterns
International Journal of High Performance Computing Applications
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Validating Quality Attribute Requirements
Software—Practice & Experience
On the radon number for p3 convexity
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
A weight-balanced branching rule for SAT
Mathematical and Computer Modelling: An International Journal
Modelling and simulation of communications network planning
Mathematical and Computer Modelling: An International Journal
Protecting sensitive relationships against inference attacks in social networks
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
A local search interface for interactive evolutionary architectural design
EvoMUSART'12 Proceedings of the First international conference on Evolutionary and Biologically Inspired Music, Sound, Art and Design
Backtracking tactics in the backtrack method for SAT
Mathematical and Computer Modelling: An International Journal
Analyzing radar emitter signals with membrane algorithms
Mathematical and Computer Modelling: An International Journal
Probabilistic satisfiability: logic-based algorithms and phase transition
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Survey: A survey on the structure of approximation classes
Computer Science Review
Approximability results for the maximum and minimum maximal induced matching problems
Discrete Optimization
George Dantzig's impact on the theory of computation
Discrete Optimization
Conflict analysis in mixed integer programming
Discrete Optimization
Querying subgraph sets with g-tries
DBSocial '12 Proceedings of the 2nd ACM SIGMOD Workshop on Databases and Social Networks
An efficient algorithm for the 3-satisfiability problem
Operations Research Letters
Local search and the local structure of NP-complete problems
Operations Research Letters
On the number of iterations of local improvement algorithms
Operations Research Letters
Checking local optimality in constrained quadratic programming is NP-hard
Operations Research Letters
Scheduling with semaphore constraints
Operations Research Letters
Tutorial on biological networks
Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery
An efficient genetic algorithm for subgraph isomorphism
Proceedings of the 14th annual conference on Genetic and evolutionary computation
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Solving difficult SAT problems by using OBDDs and greedy clique decomposition
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
The Multivariate Algorithmic Revolution and Beyond
A parameterized halting problem
The Multivariate Algorithmic Revolution and Beyond
Strong backdoors to nested satisfiability
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Designing scalable parallel SAT solvers
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Satisfiability Parsimoniously Reduces to the Tantrix™ Rotation Puzzle Problem
Fundamenta Informaticae - Machines, Computations and Universality, Part I
FaMa-OVM: a tool for the automated analysis of OVMs
Proceedings of the 16th International Software Product Line Conference - Volume 2
Single-player Monte-Carlo tree search for SameGame
Knowledge-Based Systems
Turing machine-inspired computer science results
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Solving periodic event scheduling problems with SAT
IEA/AIE'12 Proceedings of the 25th international conference on Industrial Engineering and Other Applications of Applied Intelligent Systems: advanced research in applied artificial intelligence
A linear kernel for the complementary maximal strip recovery problem
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Analytic sets in Descriptive Set Theory and NP sets in Complexity Theory
Fundamenta Informaticae
Relative Cost Random Access Machines
Fundamenta Informaticae
Communicative commitments: Model checking and complexity analysis
Knowledge-Based Systems
ABOUT A POLYHEDRON OF CUBIC GRAPHS
Fundamenta Informaticae
Programming and evolving physical self-assembling systems in three dimensions
Natural Computing: an international journal
Unconventional models of computation through non-standard logic circuits
UC'07 Proceedings of the 6th international conference on Unconventional Computation
Efficient algorithms for generalized subgraph query processing
Proceedings of the 21st ACM international conference on Information and knowledge management
Planning as satisfiability: Heuristics
Artificial Intelligence
CGStream: continuous correlated graph query for data streams
Proceedings of the 21st ACM international conference on Information and knowledge management
Continuous top-k query for graph streams
Proceedings of the 21st ACM international conference on Information and knowledge management
From inconsistency handling to non-canonical requirements management: A logical perspective
International Journal of Approximate Reasoning
Understanding, improving and parallelizing MUS finding using model rotation
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Inductive complexity of p versus NP problem
UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
Security margin evaluation of SHA-3 contest finalists through SAT-Based attacks
CISIM'12 Proceedings of the 11th IFIP TC 8 international conference on Computer Information Systems and Industrial Management
On the application of SAT solvers to the test suite minimization problem
SSBSE'12 Proceedings of the 4th international conference on Search Based Software Engineering
Lewis Dichotomies in Many-Valued Logics
Studia Logica
Model-based adaptive spatial sampling for occurrence map construction
Statistics and Computing
A multilevel memetic algorithm for large sat-encoded problems
Evolutionary Computation
Stochastic Learning for SAT-Encoded Graph Coloring Problems
International Journal of Applied Metaheuristic Computing
NSS'12 Proceedings of the 6th international conference on Network and System Security
International Journal of Advanced Intelligence Paradigms
NeMa: fast graph search with label similarity
Proceedings of the VLDB Endowment
Asynchronous multi-core incremental SAT solving
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
From sequential to parallel local search for SAT
EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
Lindex: a lattice-based index for graph databases
The VLDB Journal — The International Journal on Very Large Data Bases
Boundary properties of the satisfiability problems
Information Processing Letters
Semantics and proof-theory of depth bounded Boolean logics
Theoretical Computer Science
Gases Brownian Motion Optimization: an Algorithm for Optimization (GBMO)
Applied Soft Computing
Complexity Results for Modal Dependence Logic
Studia Logica
Detecting common scientific workflow fragments using templates and execution provenance
Proceedings of the seventh international conference on Knowledge capture
QMA variants with polynomially many provers
Quantum Information & Computation
Using substructure mining to identify misbehavior in network provenance graphs
First International Workshop on Graph Data Management Experiences and Systems
Formal verification of analog circuit parameters across variation utilizing SAT
Proceedings of the Conference on Design, Automation and Test in Europe
Guest column: the quantum PCP conjecture
ACM SIGACT News
Towards a faster network-centric subgraph census
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Semi-supervised learning using greedy max-cut
The Journal of Machine Learning Research
Viewing functions as token sequences to highlight similarities in source code
Science of Computer Programming
Color distribution can accelerate network alignment
Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
Most Tensor Problems Are NP-Hard
Journal of the ACM (JACM)
Reducing lookups for invariant checking
ECOOP'13 Proceedings of the 27th European conference on Object-Oriented Programming
Concurrent clause strengthening
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Improving glucose for incremental SAT solving with assumptions: application to MUS extraction
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Proceedings of the 6th International Conference on Security of Information and Networks
Boolean functions with long prime implicants
Information Processing Letters
A decomposition method for CNF minimality proofs
Theoretical Computer Science
Using automatic programming to generate state-of-the-art algorithms for random 3-SAT
Journal of Heuristics
Graph-based retrieval of building information models for supporting the early design stages
Advanced Engineering Informatics
On the subgraph epimorphism problem
Discrete Applied Mathematics
Automatica (Journal of IFAC)
Textual and Content-Based Search in Repositories of Web Application Models
ACM Transactions on the Web (TWEB)
Using local similarity measures to efficiently address approximate graph matching
Discrete Applied Mathematics
Is the Protein Model Assignment problem under linked branch lengths NP-hard?
Theoretical Computer Science
XSAT and NAE-SAT of linear CNF classes
Discrete Applied Mathematics
G-Tries: a data structure for storing and finding subgraphs
Data Mining and Knowledge Discovery
Querying business process model repositories
World Wide Web
Dynamic policy adaptation for inference control of queries to a propositional information system
Journal of Computer Security - DBSec 2011
Digraph width measures in parameterized algorithmics
Discrete Applied Mathematics
Functions Computable with Nonadaptive Queries to NP
Theory of Computing Systems
Complexity of Rational and Irrational Nash Equilibria
Theory of Computing Systems
Comparing Problem Solving Strategies for NP-hard Optimization Problems
Fundamenta Informaticae - Cognitive Informatics and Computational Intelligence: Theory and Applications
Discrete Tomography Data Footprint Reduction via Natural Compression
Fundamenta Informaticae - Strategies for Tomography
Hi-index | 0.27 |
It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced” means, roughly speaking, that the first problem can be solved deterministically in polynomial time provided an oracle is available for solving the second. From this notion of reducible, polynomial degrees of difficulty are defined, and it is shown that the problem of determining tautologyhood has the same polynomial degree as the problem of determining whether the first of two given graphs is isomorphic to a subgraph of the second. Other examples are discussed. A method of measuring the complexity of proof procedures for the predicate calculus is introduced and discussed.