Search results for "NP-completeness"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
22	Juan José Moreno-Navarro, Susana Muñoz-Hernández	Soundness and Completeness of an "Efficient" Negation for Prolog.	JELIA	2004	DBLP DOI BibTeX RDF	Negation in Prolog, LP and nonmonotonic reasoning, Constructive Negation
22	Rui Wang 0009, Francis C. M. Lau 0001, Yan Yan Liu	NP-Completeness Results for All-Shortest-Path Interval Routing.	SIROCCO	2004	DBLP DOI BibTeX RDF
22	John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran	Partial Bi-immunity and NP-Completeness.	CCC	2004	DBLP DOI BibTeX RDF
22	Ben C. Moszkowski	A Hierarchical Completeness Proof for Propositional Temporal Logic.	Verification: Theory and Practice	2003	DBLP DOI BibTeX RDF
22	Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos	Completeness in Differential Approximation Classes.	MFCS	2003	DBLP DOI BibTeX RDF
22	Annegret Habel, Detlef Plump	Computational Completeness of Programming Languages Based on Graph Transformation.	FoSSaCS	2001	DBLP DOI BibTeX RDF
22	Ben C. Moszkowski	An Automata-Theoretic Completeness Proof for Interval Temporal Logic.	ICALP	2000	DBLP DOI BibTeX RDF
22	Klaus Ambos-Spies	Measure Theoretic Completeness Notions for the Exponential Time Classes.	MFCS	2000	DBLP DOI BibTeX RDF
22	Rana Barua, Suman Roy 0001, Zhou Chaochen	Completeness of Neighbourhood Logic.	STACS	1999	DBLP DOI BibTeX RDF
22	Claus-Rainer Rollinger	SPOCK: A Feasibility Study on the Completeness of Part Lists.	Foundations of Computer Science: Potential - Theory - Cognition	1997	DBLP DOI BibTeX RDF
22	Christian G. Fermüller	Semantic Trees Revisited: Some New Completeness Results.	CADE	1996	DBLP DOI BibTeX RDF
22	Luc Bougé, David Cachera	On the Completeness of a Proof System for a Simple Data-Parallel Programming Language.	Euro-Par	1995	DBLP DOI BibTeX RDF	Specifying and Verifying and Reasoning about Programs, Concurrent Programming, Hoare Logic, Weakest Preconditions, Proof System, Data-Parallel Languages, Semantics of Programming Languages
22	Valentinas Kriauciukas, Michal Walicki	Reasoning and Rewriting with Set-Relations I: Ground Completeness.	CSL	1994	DBLP DOI BibTeX RDF
22	Tirza Hirst, David Harel	Completeness Results for Recursive Data Bases.	PODS	1993	DBLP DOI BibTeX RDF
22	M. R. K. Krishna Rao	Completeness of Hierarchical Combinations of term Rewriting Systems.	FSTTCS	1993	DBLP DOI BibTeX RDF
22	Priti Mishra, Margaret H. Eich	Functional Completeness in Object-Oriented Databases.	SIGMOD Rec.	1992	DBLP DOI BibTeX RDF
22	Anne Condon	A Theory of Strict P-completeness.	STACS	1992	DBLP DOI BibTeX RDF
22	Amihai Motro	Integrity = Validity + Completeness.	ACM Trans. Database Syst.	1989	DBLP DOI BibTeX RDF
22	Jia-Huai You, P. A. Subrahmanyam	On the Completeness of Narrowing for E-Unification.	KBCS	1989	DBLP DOI BibTeX RDF
22	V. S. Lakshmanan 0001	Query Evaluation with Null Values: How Complex is Completeness?	FSTTCS	1989	DBLP DOI BibTeX RDF
22	Jennifer Widom, David Gries, Fred B. Schneider	Completeness and Incompleteness of Trace-Based Network Proof Systems.	POPL	1987	DBLP DOI BibTeX RDF
22	Aaron Schulman, Dave Levin, Neil Spring	On the Fidelity of 802.11 Packet Traces.	PAM	2008	DBLP DOI BibTeX RDF
22	Tal Grinshpoun, Amnon Meisels	CompAPO: A Complete Version of the APO Algorithm.	IAT	2007	DBLP DOI BibTeX RDF
22	Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois	The complexity of semilinear problems in succinct representation.	Comput. Complex.	2006	DBLP DOI BibTeX RDF	Subject classification, 68Q15
22	Evan M. Drumwright, Victor Ng-Thow-Hing	Toward Interactive Reaching in Static Environments for Humanoid Robots.	IROS	2006	DBLP DOI BibTeX RDF
22	Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois	The Complexity of Semilinear Problems in Succinct Representation.	FCT	2005	DBLP DOI BibTeX RDF
22	Reiner Hähnle, Neil V. Murray, Erik Rosenthal	Ordered Resolution vs. Connection Graph Resolution.	IJCAR	2001	DBLP DOI BibTeX RDF
22	Harvey Friedman	Some Decision Problems of Enormous Complexity.	LICS	1999	DBLP DOI BibTeX RDF	proof thoery, complexity, trees, hypergraphs, ordinals
22	Annegret Habel, Detlef Plump	Complete Strategies for Term Graph Narrowing.	WADT	1998	DBLP DOI BibTeX RDF
22	Roberto Giacobazzi, Francesco Ranzato, Francesca Scozzari	Complete Abstract Interpretations Made Constructive.	MFCS	1998	DBLP DOI BibTeX RDF
22	Marc H. Graham, Alberto O. Mendelzon	Notions of Dependency Satisfaction.	PODS	1982	DBLP DOI BibTeX RDF
17	Wenfei Fan, Floris Geerts	Capturing missing tuples and missing values.	PODS	2010	DBLP DOI BibTeX RDF	information completeness, master data, missing data
17	Bruno Marnette, Floris Geerts	Static analysis of schema-mappings ensuring oblivious termination.	ICDT	2010	DBLP DOI BibTeX RDF	relative completeness, data integration, data exchange, schema mapping, determinacy
17	Yves Younan, Pieter Philippaerts, Frank Piessens, Wouter Joosen, Sven Lachmund, Thomas Walter 0001	Filter-resistant code injection on ARM.	CCS	2009	DBLP DOI BibTeX RDF	alphanumeric shellcode, filter-resistance, turing completeness
17	James Brotherston, Cristiano Calcagno	Classical BI: a logic for reasoning about dualising resources.	POPL	2009	DBLP DOI BibTeX RDF	bunched implications, classical bi, display logic, semantics, completeness, cut-elimination, resource models
17	Miklós Erdélyi-Szabó, László Kálmán, Agi Kurucz	Towards a natural language semantics without functors and operands.	J. Log. Lang. Inf.	2008	DBLP DOI BibTeX RDF	Finite axiomatisability, Finite entailment problem, Function/argument metaphor, Pieces of evidence, Measurements, Completeness, Compositionality, Decision algorithm, Natural language semantics
17	Murdoch James Gabbay, Aad Mathijssen	Capture-avoiding substitution as a nominal algebra.	Formal Aspects Comput.	2008	DBLP DOI BibTeX RDF	Nominal techniques, Nominal algebra, Capture-avoidance, Nominal rewriting, Omega-completeness, Binding, Substitution
17	Marcel Karnstedt, Kai-Uwe Sattler, Michael Haß, Manfred Hauswirth, Brahmananda Sapkota, Roman Schmidt	Estimating the number of answers with guarantees for structured queries in p2p databases.	CIKM	2008	DBLP DOI BibTeX RDF	query completeness, query processing, dht, probabilistic guarantees
17	Mihai Lupu, Beng Chin Ooi, Y. C. Tay	Paths to stardom: calibrating the potential of a peer-based data management system.	SIGMOD Conference	2008	DBLP DOI BibTeX RDF	query completeness, peer to peer, cayley graph
17	Zhenhua Duan, Nan Zhang 0001	A Complete Axiomatization of Propositional Projection Temporal Logic.	TASE	2008	DBLP DOI BibTeX RDF	temporal logic, completeness, projection, inference rules, axiom
17	Roberto Cignoli, Francesc Esteva, Lluís Godo	On Lukasiewicz Logic with Truth Constants.	IFSA (2)	2007	DBLP DOI BibTeX RDF	truth-constants, canonical standard completeness, ?ukasiewicz logic
17	Zhongnan Shen, Jianwen Su	On automated composition for web services.	WWW	2007	DBLP DOI BibTeX RDF	goal service, tightening, service composition, service discovery, completeness
17	Yalin Zheng, Huaqiang Yuan, Jing Zheng, Guang Yang 0002, Yongcheng Bai	Similarity Mass and Approximate Reasoning.	ICFIE	2007	DBLP DOI BibTeX RDF	Formula Mass, Knowledge Mass, ??logic, ??algorithm, ??completeness, Approximate Reasoning
17	Seiki Akama, Kazumi Nakamatsu, Jair Minoro Abe	A Natural Deduction System for Annotated Predicate Logic.	KES (2)	2007	DBLP DOI BibTeX RDF	completeness, natural deduction, Annotated logics
17	Antonina Dattolo, Angelo Di Iorio, Silvia Duca, Antonio Angelo Feliziani, Fabio Vitali	Structural Patterns for Descriptive Documents.	ICWE	2007	DBLP DOI BibTeX RDF	descriptive schemas, Patterns, completeness, grammars
17	Francesco Belardinelli, Alessio Lomuscio	A quantified epistemic logic for reasoning about multiagent systems.	AAMAS	2007	DBLP DOI BibTeX RDF	completeness, first-order logic, epistemic logic
17	Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier	Error Compensation in Leaf Power Problems.	Algorithmica	2006	DBLP DOI BibTeX RDF	Graph modification, Forbidden subgraph characterization, NP-completeness, Graph algorithms, Fixed-parameter tractability, Leaf power, Graph power
17	Xiaohong Zhang 0001, Huacan He, Yang Xu 0001	A fuzzy logic system based on Schweizer-Sklar t-norm.	Sci. China Ser. F Inf. Sci.	2006	DBLP DOI BibTeX RDF	fuzzy logic system UL, UL-algebras, completeness, approximate reasoning, t-norm
17	Patrick Blackburn, Balder ten Cate	Pure Extensions, Proof Rules, and Hybrid Axiomatics.	Stud Logica	2006	DBLP DOI BibTeX RDF	completeness, modal logic, Hybrid logic, proof rules, axiomatisation, nominals
17	Stefan Porschen, Ewald Speckenmeyer, Bert Randerath	On Linear CNF Formulas.	SAT	2006	DBLP DOI BibTeX RDF	linear CNF formula, edge colouring, linear hypergraph, NP-completeness, satisfiability, latin square
17	Isabelle Gnaedig, Hélène Kirchner	Computing constructor forms with non terminating rewrite programs.	PPDP	2006	DBLP DOI BibTeX RDF	constructor, abstraction, termination, narrowing, ordering constraint, sufficient completeness
17	Walter Guttmann, Markus Maucher	Variations on an Ordering Theme with Constraints.	IFIP TCS	2006	DBLP DOI BibTeX RDF	computational complexity, NP-completeness, total ordering, topological sorting, betweenness, cyclic ordering
17	Christian F. J. Lange	Improving the quality of UML models in practice.	ICSE	2006	DBLP DOI BibTeX RDF	UML, consistency, quality, completeness, defect detection
17	Tadeusz Litak, Frank Wolter	All Finitely Axiomatizable Tense Logics of Linear Time Flows Are CoNP-complete.	Stud Logica	2005	DBLP DOI BibTeX RDF	frame incompleteness, computational complexity, temporal logic, NP-completeness, tense logic
17	Miroslaw Szatkowski	Semantic Analysis of some Variants of Anderson-like Ontological Proofs.	Stud Logica	2005	DBLP DOI BibTeX RDF	Ontological proof, 2nd order modal logic, positive properties, completeness
17	Dmitrij P. Skvortsov	On the Predicate Logic of Linear Kripke Frames and some of its Extensions.	Stud Logica	2005	DBLP DOI BibTeX RDF	Intermediate predicate logics, Kripke sheaves, completeness and incompleteness, Kripke semantics
17	Norihiro Kamide	Gentzen-Type Methods for Bilattice Negation.	Stud Logica	2005	DBLP DOI BibTeX RDF	Bilattice negation, completeness, sequent calculus, substructural logic, strong negation
17	Alain Darte, Guillaume Huard	New Complexity Results on Array Contraction and Related Problems.	J. VLSI Signal Process.	2005	DBLP DOI BibTeX RDF	array contraction, NP-completeness, integer linear programming, code optimization, memory reduction
17	Stefan Porschen	Solving Minimum Weight Exact Satisfiability in Time O(20.2441n).	ISAAC	2005	DBLP DOI BibTeX RDF	minimum weight exact satisfiability, branching tree, minimum perfect matching, NP-completeness, exact algorithm
17	Michel Raynal, Matthieu Roy	Allowing Atomic Objects to Coexist with Sequentially Consistent Objects.	PaCT	2005	DBLP DOI BibTeX RDF	Atomic Consistency, Combination of consistency criteria, Shared Memory Abstraction, Message Passing, NP-Completeness, Asynchronous System, Sequential Consistency, Linearizability
17	Predrag T. Tosic, Gul A. Agha	On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata.	UC	2005	DBLP DOI BibTeX RDF	Cellular and graph automata, sequential and synchronous dynamical systems, configuration space properties, #P-completeness, computational complexity
17	Stefan Porschen	On Some Weighted Satisfiability and Graph Problems.	SOFSEM	2005	DBLP DOI BibTeX RDF	(weighted) exact satisfiability, not-all-equal satisfiability, NP-completeness, exact algorithm, counting problem, maximum weight independent set
17	Theo Härder, Andreas Bühmann	Datenbank-Caching - Eine systematische Analyse möglicher Verfahren.	Inform. Forsch. Entwickl.	2004	DBLP DOI BibTeX RDF	predicate completeness, query processing, Database systems, materialized views, database caching
17	Bernhard Heinemann	A Modal Logic for Discretely Descending Chains of Sets.	Stud Logica	2004	DBLP DOI BibTeX RDF	modal logic of subset spaces, completeness, decidability, temporalization
17	Hye Yeon Kim, Frederick T. Sheldon	Testing Software Requirements with Z and Statecharts Applied to an Embedded Control System.	Softw. Qual. J.	2004	DBLP DOI BibTeX RDF	requirements specification and validation, fault-tolerance, consistency, completeness, Statecharts, Z
17	Pawel Górecki 0001	Reconciliation problems for duplication, loss and horizontal gene transfer.	RECOMB	2004	DBLP DOI BibTeX RDF	duplication-loss model, NP-completeness, reconciliation, horizontal gene transfer
17	Bernhard Heinemann	A Hybrid Logic of Knowledge Supporting Topological Reasoning.	AMAST	2004	DBLP DOI BibTeX RDF	logical frameworks for reasoning, reasoning about knowledge and topology, completeness, decidability, hybridization
17	Petr Hlinený	Crossing Number Is Hard for Cubic Graphs.	MFCS	2004	DBLP DOI BibTeX RDF	NP-completeness, Crossing number, cubic graph
17	Stefan Porschen, Ewald Speckenmeyer	Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF	(hidden) Horn formula, quadratic formula, minimal vertex cover, NP-completeness, satisfiability, fixed-parameter tractability
17	Wu Jigang, Thambipillai Srikanthan	Finding High Performance Solution in Reconfigurable Mesh-Connected VLSI Arrays.	Asia-Pacific Computer Systems Architecture Conference	2004	DBLP DOI BibTeX RDF	Degradable VLSI array, fault-tolerance, reconfiguration, NP-completeness, heuristic algorithm
17	Régis Barbanchon, Etienne Grandjean	The Minimal Logically-Defined NP-Complete Problem.	STACS	2004	DBLP DOI BibTeX RDF	Computational complexity, NP-completeness, descriptive complexity, finite model theory, parsimony, second-order logic
17	Stefan Porschen	On the Time Complexity of Rectangular Covering Problems in the Discrete Plane.	ICCSA (3)	2004	DBLP DOI BibTeX RDF	rectangular set cover, integer lattice, NP-completeness, discrete plane
17	Nizar Marcus	E-Compactness in Pointfree Topology.	Appl. Categorical Struct.	2003	DBLP DOI BibTeX RDF	nearness frames, relatively spatial reflections, E-complete frames, E-compact frames, Cauchy completeness, frames
17	Wu Jigang, Thambipillai Srikanthan	On the Reconfiguration Algorithm for Fault-Tolerant VLSI Arrays.	International Conference on Computational Science	2003	DBLP DOI BibTeX RDF	degradable VLSI array, fault-tolerance, reconfiguration, NP-completeness, greedy algorithm
17	Robert W. Irving, David F. Manlove, Sandy Scott	Strong Stability in the Hospitals/Residents Problem.	STACS	2003	DBLP DOI BibTeX RDF	stable matching problem, hospitals/ residents problem, lower bound, NP-completeness, polynomial-time algorithm, strong stability
17	Pino Caballero-Gil, Candelaria Hernández-Goya	A Zero-Knowledge Identification Scheme.	MMM-ACNS	2003	DBLP DOI BibTeX RDF	Average-case completeness, Identification, Zero-knowledge
17	Luigi Di Lascio	Hilbertian systems, analytic fuzzy tableaux and cut rule elimination in rational pavelka logic.	SEKE	2002	DBLP DOI BibTeX RDF	cut rule, fuzzy prepositional logic, galois relation, pavelka semantics, completeness, soundness, MV-algebra, tableaux
17	Hasan M. Jamil, Gillian Dobbie	A Model Theoretic Semantics for Multi-level Secure Deductive Databases.	ICLP	2002	DBLP DOI BibTeX RDF	MLS databases, belief assertion, security, reasoning, deductive databases, soundness and completeness
17	Edith Hemaspaandra, Jörg Rothe, Holger Spakowski	Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP.	WG	2002	DBLP DOI BibTeX RDF	minimum vertex cover heuristics, parallel access to NP, Computational complexity, approximation, completeness
17	Wu Jigang, Heiko Schröder, Thambipillai Srikanthan	New Architecture and Algorithms for Degradable VLSI/WSI Arrays.	COCOON	2002	DBLP DOI BibTeX RDF	Degradable VLSI/WSI array, fault-tolerance, reconfiguration, NP-completeness, greedy algorithm
17	Luigi Di Lascio	Analytic fuzzy tableaux.	Soft Comput.	2001	DBLP DOI BibTeX RDF	Fuzzy deductive systems, Fuzzy logic, Completeness, Decidability, Soundness, Tableaux
17	Hideaki Hori, Shinichi Shimozono, Masayuki Takeda, Ayumi Shinohara	Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works.	ISAAC	2001	DBLP DOI BibTeX RDF	fragmentary pattern, string resemblance, polynomial-time approximation, NP-completeness, string matching
17	Andrzej S. Murawski, C.-H. Luke Ong	Evolving Games and Essential Nets for Affine Polymorphism.	TLCA	2001	DBLP DOI BibTeX RDF	Full Completeness, Polymorphism, Linear Logic, Game Semantics
17	Qizhi Fang, Shanfeng Zhu, Mao-cheng Cai, Xiaotie Deng	Membership for Core of LP Games and Other Games.	COCOON	2001	DBLP DOI BibTeX RDF	linear programming, NP-completeness, network flow, Steiner tree, core, cooperative game
17	George E. Strecker	Flows With Respect to a Functor.	Appl. Categorical Struct.	2000	DBLP DOI BibTeX RDF	(E,M)-functor, coadjoint functor, wolf, strongly complete, extremally complete, completeness, factorization, flow
17	Alexander Brodsky 0001, Csilla Farkas, Sushil Jajodia	Secure Databases: Constraints, Inference Channels, and Monitoring Disclosures.	IEEE Trans. Knowl. Data Eng.	2000	DBLP DOI BibTeX RDF	data-dependent disclosure, data-independent disclosure, constraints, completeness, decidability, soundness, Multilevel security, data confidentiality, inference algorithms, inference problem
17	Wolfgang Slany	The Complexity of Graph Ramsey Games.	Computers and Games	2000	DBLP DOI BibTeX RDF	combinatorial games, graph Ramsey theory, Ramsey game, winning strategy, achievement game, avoidance game, the game of Sim, endgames, complexity, Java applet, edge coloring, PSPACE-completeness
17	Samson Abramsky, Marina Lenisa	A Fully Complete PER Model for ML Polymorphic Types.	CSL	2000	DBLP DOI BibTeX RDF	ML-polymorphic types, PER models, full completeness, linear logic, Geometry of Interaction
17	Thomas Kleymann	Hoare Logic and Auxiliary Variables.	Formal Aspects Comput.	1999	DBLP DOI BibTeX RDF	Adaptation Completeness, Most General Formula, Hoare Logic, VDM, Auxiliary variables
17	Matthias Blume	Dependency analysis for Standard ML.	ACM Trans. Program. Lang. Syst.	1999	DBLP DOI BibTeX RDF	compilation management, NP-completeness, dependency analysis
17	Flemming Nielson, Hanne Riis Nielson	Type and Effect Systems.	Correct System Design	1999	DBLP DOI BibTeX RDF	Polymorphic type systems, effect annotations, subeffecting and subtyping, type inference algorithms, syntactic soundness and completeness, Analyses for control flow, binding times, region structure and communication structure, side effects, semantic correctness
17	Renren Liu	Research on the Similarity among Precomplete Sets Preserving m-ary Relations in Partial K-Valued Logic.	ISMVL	1999	DBLP DOI BibTeX RDF	Partial multiple-valued logic, Sheffer functions, completeness
17	Kazuo Iwama, Mitsushi Nouzoe, Shuzo Yajima	Optimizing OBDDs Is Still Intractable for Monotone Functions.	MFCS	1998	DBLP DOI BibTeX RDF	NP-completeness, Ordered Binary Decision Diagrams, Monotone Functions
17	Peter Lindsey, Yaowei Liu, Owen Traynor	A Generic Model for Fine Grained Configuration Management Including Version Control and Traceability.	Australian Software Engineering Conference	1997	DBLP DOI BibTeX RDF	fine grained configuration management, trusted support, high-integrity software development, formal specification, consistency, requirements, object-oriented database, completeness, traceability, configuration management, version control, prototype system, design documents
17	Fritz Henglein, Jakob Rehof	The Complexity of Subtype Entailment for Simple Types.	LICS	1997	DBLP DOI BibTeX RDF	subtype entailment complexity, atomic entailment, coNP-completeness, complexity-theoretic marker, exponential explosion, subtype inference, structural complexity bounds, computability, satisfiability, axiomatization, linear-time algorithm
17	Asger Munk Nielsen, Peter Kornerup	On Radix Representation of Rings.	IEEE Symposium on Computer Arithmetic	1997	DBLP DOI BibTeX RDF	radix representation, complex number systems, Gaussian integers, Eisenstein integers, mappings, redundancy, completeness, rings, arithmetic
17	Alexander Bolotov, Michael Fisher 0001	A Resolution Method For CTL Branching-Time Temporal Logic.	TIME	1997	DBLP DOI BibTeX RDF	resolution method, CTL branching-time temporal logic, clausal resolution method, extended CTL, fairness operators, step resolution, temporal resolution rule, linear-time temporal resolution, temporal logic, completeness, normal form, linear temporal logic, computation tree logic, CTL*
17	Robert N. Smith, Sourav Bhattacharya	Firewall placement in a large network topology.	FTDCS	1997	DBLP DOI BibTeX RDF	firewall placement heuristics, large network topology, multi-user distributed information environment, firewall cascade, potential attack point, comprehensive security protection, end-to-end security protection, simulation, performance, network security, completeness, authorisation, operations research, cost optimization, delay minimization, sensitive data, confidence degree
17	Frédéric Cuppens, Claire Saurel	Specifying a security policy: a case study.	CSFW	1996	DBLP DOI BibTeX RDF	high risk environment, interoperability problems, logic-based approach, formal specification, consistency, completeness, security of data, formal logic, deontic logic, security policy specification
17	Grant Pogosyan	Efficiently Irreducible Bases in Multiple-Valued Logic.	ISMVL	1996	DBLP DOI BibTeX RDF	efficiency, completeness, circuit design, logic functions, basis