Search results for "P-complete"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
17	Eugene W. Stark, Rance Cleaveland, Scott A. Smolka	Probabilistic I/O Automata: Theories of Two Equivalences.	CONCUR	2006	DBLP DOI BibTeX RDF	process equivalences, continuous-time Markov chains, equational theories, stochastic process algebras, complete axiomatizations
17	Fábio Protti, Maise Dantas da Silva, Jayme Luiz Szwarcfiter	Applying Modular Decomposition to Parameterized Bicluster Editing.	IWPEC	2006	DBLP DOI BibTeX RDF	edge modification problems, bicluster graphs, NP-complete problems, fixed-parameter tractability, cluster graphs
17	Oswin Aichholzer, Hannes Krasser	Abstract order type extension and new results on the rectilinear crossing number.	SCG	2005	DBLP DOI BibTeX RDF	pseudoline arrangement, rectilinear crossing number, complete graph, order type
17	Tadeusz Litak	Modal Incompleteness Revisited.	Stud Logica	2004	DBLP DOI BibTeX RDF	general frames, Kripke incompleteness, neighbourhood incompleteness, complete incompleteness, modal algebras
17	Pei-Chi Wu	On exponential-time completeness of the circularity problem for attribute grammars.	ACM Trans. Program. Lang. Syst.	2004	DBLP DOI BibTeX RDF	EXPTIME-complete, circularity problem, Attribute grammars, alternating Turing machines
17	Dan Noje, Barnabás Bede	Vectorial MV-algebras.	Soft Comput.	2003	DBLP DOI BibTeX RDF	Approximation by polynomials, Completions, MV-algebras, Complete lattices
17	Gerard Ligozat	When Tables Tell It All: Qualitative Spatial and Temporal Reasoning Based on Linear Orderings.	COSIT	2001	DBLP DOI BibTeX RDF	weak representation, complete theory, relation algebra, temporal reasoning, spatial reasoning
17	Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Yannis C. Stamatiou	Locating Information with Uncertainty in Fully Interconnected Networks.	DISC	2000	DBLP DOI BibTeX RDF	Information Retrieval, Search, Uncertainty, Random Walks, Complete Network
17	Helmut Thiele	On Isomorphisms between the Lattice of Tolerance Relations and Lattices of Clusterings.	ISMVL	1996	DBLP DOI BibTeX RDF	lattice of tolerance relations, lattices of clusterings, one-to-one correspondences, classical set theory, bijections, complete atomistic boolean algebra, strongly model-compact coverings, cluster analysis, set theory, multivalued logic, equivalence classes, isomorphisms, similarity relations, mathematical foundations, lattice isomorphisms
17	Christian Glaßer, Alan L. Selman, Samik Sengupta	Reductions between Disjoint NP-Pairs.	CCC	2004	DBLP DOI BibTeX RDF
17	Vladimir V. Rybakov	Barwise's information frames and modal logics.	Arch. Math. Log.	2003	DBLP DOI BibTeX RDF
16	Jian-min Han, Huiqun Yu, Yu Juan, Ting-ting Cen	A Complete (alpha, k)-Anonymity Model for Sensitive Values Individuation Preservation.	ISECS	2008	DBLP DOI BibTeX RDF	(a, k)-Anonymity Model, Homogeneity Attack, K-anonymity, l-Diversity
16	Xinyu Feng 0001, Zhong Shao, Yu Guo, Yuan Dong	Combining Domain-Specific and Foundational Logics to Verify Complete Software Systems.	VSTTE	2008	DBLP DOI BibTeX RDF
16	Randy Goebel	Folk Reducibility and AI-Complete Problems.	KI	2008	DBLP DOI BibTeX RDF
16	Petr A. Golovach, Jan Kratochvíl	Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity.	TAMC	2008	DBLP DOI BibTeX RDF	Subject Computational complexity, graph algorithms
16	S. Dov Gordon, Carmit Hazay, Jonathan Katz, Yehuda Lindell	Complete fairness in secure two-party computation.	STOC	2008	DBLP DOI BibTeX RDF	cryptography, fairness, secure computation
16	Petr A. Golovach, Jan Kratochvíl	Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs.	WG	2007	DBLP DOI BibTeX RDF	Computational complexity, graph algorithms
16	Anbang Xu, Xin Jin, YuGang Jiang, Ping Guo 0002	Complete Two-Dimensional PCA for Face Recognition.	ICPR (3)	2006	DBLP DOI BibTeX RDF
16	Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez	Clique Graph Recognition Is NP-Complete.	WG	2006	DBLP DOI BibTeX RDF
16	Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang	Redundancy in Complete Sets.	STACS	2006	DBLP DOI BibTeX RDF
16	Thomas Ågotnes, Michal Walicki	Strongly Complete Axiomatizations of "Knowing at Most" in Syntactic Structures.	CLIMA	2005	DBLP DOI BibTeX RDF
16	S. J. Gismondi, E. R. Swart	A model of the coNP-complete non-Hamilton tour decision problem for directed graphs.	Math. Program.	2004	DBLP DOI BibTeX RDF	Extended formulation, Assignment polytope, coNP, Projection, Hamiltonicity
16	Bruno B. Gonçalves, Pedro M. Q. Aguiar	Complete 3-d models from video: a global approach.	ICIP	2004	DBLP DOI BibTeX RDF
16	Liana Bozga, Cristian Ene, Yassine Lakhnech	On the Existence of an Effective and Complete Inference System for Cryptographic Protocols.	FoSSaCS	2004	DBLP DOI BibTeX RDF
16	Prosenjit Bose, Ferran Hurtado, Eduardo Rivera-Campo, David R. Wood	Partitions of Complete Geometric Graphs into Plane Trees.	GD	2004	DBLP DOI BibTeX RDF
16	Jeanette Auer, Richard Hall	Investigating ID3-Induced Rules from Low-Dimensional Data Cleaned by Complete Case Analysis.	Australian Conference on Artificial Intelligence	2004	DBLP DOI BibTeX RDF
16	Jeong Han Kim, Van H. Vu	Small Complete Arcs in Projective Planes.	Comb.	2003	DBLP DOI BibTeX RDF	AMS Subject Classification (2000): 05B25
16	Xiao-Shan Gao, Xiaorong Hou, Jianliang Tang, Hang-Fei Cheng	Complete Solution Classification for the Perspective-Three-Point Problem.	IEEE Trans. Pattern Anal. Mach. Intell.	2003	DBLP DOI BibTeX RDF	Perspective-Three-Point problem, solution classification, geometric criteria, Wu-Ritt's zero decomposition method, pose determination, analytical solutions
16	Matthias Fitzi, Juan A. Garay, Ueli M. Maurer, Rafail Ostrovsky	Minimal Complete Primitives for Secure Multi-party Computation.	CRYPTO	2001	DBLP DOI BibTeX RDF
16	Carla Denise Castanho, Wei Chen 0003, Koichi Wada 0001, Akihiro Fujiwara	Parallelizability of Some P-Complete Geometric Problems in the EREW-PRAM.	COCOON	2001	DBLP DOI BibTeX RDF
16	Roberto Giacobazzi, Francesco Ranzato, Francesca Scozzari	Making abstract interpretations complete.	J. ACM	2000	DBLP DOI BibTeX RDF
16	Tom Brijs, Gilbert Swinnen, Koen Vanhoof, Geert Wets	Comparing Complete and Partial Classification for Identifying Latently Dissatisfied Customers.	ECML	2000	DBLP DOI BibTeX RDF
16	Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe	Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP.	J. ACM	1997	DBLP DOI BibTeX RDF	Lewis Carroll, election systems, majority rule, completeness
16	Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe	Exact Analysis of Dodgson Elections: Lewis Carroll's 1876 Voting System is Complete for Parallel Access to NP.	ICALP	1997	DBLP DOI BibTeX RDF
16	Arend Rensink	A Complete Theory of Deterministic Event Structures.	CONCUR	1995	DBLP DOI BibTeX RDF
16	Klaus Ambos-Spies, Sebastiaan Terwijn, Xizhong Zheng	Resource Bounded Randomness and Weakly Complete Problems.	ISAAC	1994	DBLP DOI BibTeX RDF
16	Etienne Grandjean	Linear Time Algorithms and NP-Complete Problems.	CSL	1992	DBLP DOI BibTeX RDF
16	Constantine N. K. Osiakwan, Selim G. Akl	The maximum weight perfect matching problem for complete weighted graphs is in PC.	SPDP	1990	DBLP DOI BibTeX RDF
16	Tony W. Lai, Derick Wood	Updating Almost Complete Trees or One Level Makes All the Difference.	STACS	1990	DBLP DOI BibTeX RDF
16	Gautam Das 0001, Deborah Joseph	Which Triangulations Approximate the Complete Graph?.	Optimal Algorithms	1989	DBLP DOI BibTeX RDF
15	Jinyu Zhou, Yu Tang, Jigao Yan, Tianjiao Yan, Jun Gu	Complete convergence and complete moment convergence for maximal weighted sums of arrays of rowwise extended negatively dependent random variables with statistical applications.	J. Comput. Appl. Math.	2024	DBLP DOI BibTeX RDF
15	Snir Hordan, Tal Amir, Steven J. Gortler, Nadav Dym	Complete Neural Networks for Complete Euclidean Graphs.	AAAI	2024	DBLP DOI BibTeX RDF
15	Michael A. Bekos, Michael Kaufmann 0001, Maria Eleni Pavlidi, Xenia Rieger	On the Deque and Rique Numbers of Complete and Complete Bipartite Graphs.	CoRR	2023	DBLP DOI BibTeX RDF
15	Shonda Dueck	Cyclic partitions of complete and almost complete uniform hypergraphs.	Discuss. Math. Graph Theory	2022	DBLP DOI BibTeX RDF
15	Janejira Laomala, Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit, Watcharintorn Ruksasakchai	The Strong Equitable Vertex 1-Arboricity of Complete Bipartite Graphs and Balanced Complete k-Partite Graphs.	Symmetry	2022	DBLP DOI BibTeX RDF
15	Yuntian Wang, Bao Qing Hu	Constructing overlap and grouping functions on complete lattices by means of complete homomorphisms.	Fuzzy Sets Syst.	2022	DBLP DOI BibTeX RDF
15	Anurag Singh 0003	Higher matching complexes of complete graphs and complete bipartite graphs.	Discret. Math.	2022	DBLP DOI BibTeX RDF
15	Tay-Woei Shyu	Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each.	Discuss. Math. Graph Theory	2021	DBLP DOI BibTeX RDF
15	Peter Adams 0001, Ryan C. Bunge, Roger B. Eggleton, Saad I. El-Zanati, Ugur Odabasi, Wannasiri Wannasit	Decompositions of complete graphs and complete bipartite graphs into bipartite cubic graphs of order at most 12.	Bull. ICA	2021	DBLP BibTeX RDF
15	Tareq M. Al-shami	Complete Hausdorffness and Complete Regularity on Supra Topological Spaces.	J. Appl. Math.	2021	DBLP DOI BibTeX RDF
15	Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann 0002	HyperLTL Satisfiability is Σ11-complete, HyperCTL* Satisfiability is Σ12-complete.	CoRR	2021	DBLP BibTeX RDF
15	Anatolij Dvurecenskij, Omid Zahiri	Locally σ-complete and locally complete EMV-algebras.	Soft Comput.	2021	DBLP DOI BibTeX RDF
15	Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann 0002	HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete.	MFCS	2021	DBLP DOI BibTeX RDF
15	Kaidi Xu, Huan Zhang 0001, Shiqi Wang 0002, Yihan Wang, Suman Jana, Xue Lin, Cho-Jui Hsieh	Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete Verifiers.	ICLR	2021	DBLP BibTeX RDF
15	Radha Madhavi Duggaraju, Lipika Mazumdar	An algorithm for generating generalized splines on graphs such as complete graphs, complete bipartite graphs and hypercubes.	AKCE Int. J. Graphs Comb.	2020	DBLP DOI BibTeX RDF
15	Kaidi Xu, Huan Zhang 0001, Shiqi Wang 0002, Yihan Wang, Suman Jana, Xue Lin, Cho-Jui Hsieh	Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete Verifiers.	CoRR	2020	DBLP BibTeX RDF
15	Jun Ge, Fengming Dong	Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs.	Discret. Appl. Math.	2020	DBLP DOI BibTeX RDF
15	Maxence Ferrari	Study of a Biosonar Based on the Modeling of a Complete Chain of Emission-Propagation-Reception with Validation on Sperm Whales. (Etude de sonar bio-inspiré basée sur la modélisation d'une chaîne complète d'émission-propagation-réception - Validation sur le cachalot).		2020	RDF
15	Sk Amanathulla, Sankar Sahoo, Madhumangal Pal	L (3, 1, 1)-labeling numbers of square of paths, complete graphs and complete bipartite graphs.	J. Intell. Fuzzy Syst.	2019	DBLP DOI BibTeX RDF
15	Matthew de Brecht, Jean Goubault-Larrecq, Xiaodong Jia 0002, Zhenchao Lyu	Domain-complete and LCS-complete Spaces.	ISDT	2019	DBLP DOI BibTeX RDF
15	Lucas Colucci, Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei	Terminal-pairability in complete bipartite graphs with non-bipartite demands: Edge-disjoint paths in complete bipartite graphs.	Theor. Comput. Sci.	2019	DBLP DOI BibTeX RDF
15		Complete Disjoint coNP-Pairs but no Complete Total Polynomial Search Problems Relative to an Oracle.	CoRR	2019	DBLP BibTeX RDF
15	Xihe Li, Ligong Wang 0001, Xiangxiang Liu	Complete graphs and complete bipartite graphs without rainbow path.	Discret. Math.	2019	DBLP DOI BibTeX RDF
15	Matthew Philippe, Raphaël M. Jungers	A complete characterization of the ordering of path-complete methods.	HSCC	2019	DBLP DOI BibTeX RDF
15		Complete Disjoint CoNP-Pairs but No Complete Total Polynomial Search Problems Relative to an Oracle.	FCT	2019	DBLP DOI BibTeX RDF
15	Éric Balandraud, Fabio Tardella, Maurice Queyranne	Largest Minimal Inversion-Complete and Pair-Complete Sets of Permutations.	Comb.	2018	DBLP DOI BibTeX RDF
15	Saad I. El-Zanati, Uthoomporn Jongthawonwuth, Heather Jordon, Charles Vanden Eynden	Decomposing the complete graph and the complete graph minus a 1-factor into copies of a graph G where G is the union of two disjoint cycles.	Eur. J. Comb.	2018	DBLP DOI BibTeX RDF
15	Salama Nagy Daoud	Number of Spanning trees in Different Products of Complete and Complete Tripartite Graphs.	Ars Comb.	2018	DBLP BibTeX RDF
15	Carl Bürger, Louis DeBiasio, Hannah Guggiari, Max Pitz	Partitioning edge-coloured complete symmetric digraphs into monochromatic complete subgraphs.	Discret. Math.	2018	DBLP DOI BibTeX RDF
15	Simon Thomas 0001	Complete groups are complete co-analytic.	Arch. Math. Log.	2018	DBLP DOI BibTeX RDF
15	Na Zhu	Signature of Quasi-Complete Graphs and Quasi-Complete Bipartite Graphs.	ICNC-FSKD	2018	DBLP DOI BibTeX RDF
15	Mikhail N. Rybakov, Dmitry Shkatov	A Recursively Enumerable Kripke Complete First-Order Logic Not Complete with Respect to a First-Order Definable Class of Frames.	Advances in Modal Logic	2018	DBLP BibTeX RDF
15	Dmitrij P. Skvortsov	Remark on the Superintuitionistic Predicate Logic of Kripke Frames of Finite Height with Constant Domains: A Simpler Kripke Complete Logic That Is Not Strongly Complete.	Advances in Modal Logic	2018	DBLP BibTeX RDF
15	Jean-Emmanuel Bibault	Prédiction par Deep Learning de la réponse complète après radiochimiothérapie pré-opératoire du cancer du rectum localement avancé. (Deep learning to predict pathologic complete response to neoadjuvant chemoradiation in locally-advanced rectal cancer).		2018	RDF
15	Zhe Chen 0011	Parametric runtime verification is NP-complete and coNP-complete.	Inf. Process. Lett.	2017	DBLP DOI BibTeX RDF
15	Jesús Medina 0001	Notes on "solution sets of inf- αT fuzzy relational equations on complete Brouwerian lattices" and "fuzzy relational equations on complete Brouwerian lattices".	Inf. Sci.	2017	DBLP DOI BibTeX RDF
15		The Complete Extensions do not form a Complete Semilattice.	CoRR	2017	DBLP BibTeX RDF
15	S. S. Rukmani, V. Vijayalakshmi 0002	Multiplicity of Stars in Complete Graphs and Complete r-partite Graphs.	Ars Comb.	2017	DBLP BibTeX RDF
15	Kazutoshi Ando, Ryosuke Inagaki, Kazuya Shoji	Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions.	Discret. Appl. Math.	2017	DBLP DOI BibTeX RDF
15	Jan Konecny 0001, Michal Krupka	Complete relations on fuzzy complete lattices.	Fuzzy Sets Syst.	2017	DBLP DOI BibTeX RDF
15	Wenjing Li, Xueliang Li 0001, Jingshu Zhang	The k-proper index of complete bipartite and complete multipartite graphs.	Australas. J Comb.	2017	DBLP BibTeX RDF
15	Ellen Gethner, Leslie Hogben, Bernard Lidický, Florian Pfender, Amanda Ruiz, Michael Young	On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs.	J. Graph Theory	2017	DBLP DOI BibTeX RDF
15	Luay Yassin Taha, Esam Abdel-Raheem	A null space approach for complete and over-complete blind source separation of autoregressive source signals.	CCECE	2017	DBLP DOI BibTeX RDF
15	Carl Johan Casselgren, Roland Häggkvist	Coloring Complete and Complete Bipartite Graphs from Random Lists.	Graphs Comb.	2016	DBLP DOI BibTeX RDF
15	Gülnaz Boruzanli Ekinci, Alpay Kirlangiç	Super connectivity of Kronecker product of complete bipartite graphs and complete graphs.	Discret. Math.	2016	DBLP DOI BibTeX RDF
15	Akihiro Uejima, Hiroaki Suzuki	Fillmat is NP-Complete and ASP-Complete.	J. Inf. Process.	2015	DBLP DOI BibTeX RDF
15	Tay-Woei Shyu	Decomposition of Complete Bipartite Digraphs and Complete Digraphs into Directed Paths and Directed Cycles of Fixed Even Length.	Graphs Comb.	2015	DBLP DOI BibTeX RDF
15	Jan Konecny 0001, Michal Krupka	Complete relations on fuzzy complete lattices.	CoRR	2015	DBLP BibTeX RDF
15	Gek Ling Chia, Chan L. Lee	Crossing Numbers of Nearly Complete Graphs and Nearly Complete Bipartite Graphs.	Ars Comb.	2015	DBLP BibTeX RDF
15	Edita Mácajová, Edita Rollová	Nowhere-Zero Flows on Signed Complete and Complete Bipartite Graphs.	J. Graph Theory	2015	DBLP DOI BibTeX RDF
15	Shuchi Chawla 0001, Konstantin Makarychev, Tselil Schramm, Grigory Yaroslavtsev	Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs.	STOC	2015	DBLP DOI BibTeX RDF
15	Yoshimi Egawa, Michitaka Furuya	Forbidden Triples Containing a Complete Graph and a Complete Bipartite Graph of Small Order.	Graphs Comb.	2014	DBLP DOI BibTeX RDF
15	Shuchi Chawla 0001, Konstantin Makarychev, Tselil Schramm, Grigory Yaroslavtsev	Near Optimal LP Rounding Algorithm for Correlation Clustering on Complete and Complete k-partite Graphs.	CoRR	2014	DBLP BibTeX RDF
15	Zhidan Yan, Wei Wang 0052	Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs.	Discret. Appl. Math.	2014	DBLP DOI BibTeX RDF
15	John Lenz, Dhruv Mubayi	Multicolor Ramsey Numbers For Complete Bipartite Versus Complete Graphs.	J. Graph Theory	2014	DBLP DOI BibTeX RDF
15	Kostas Angelopoulos, George-Othon Glentis, Andreas Jakobsson	Computationally efficient sparsity-inducing coherence spectrum estimation of complete and non-complete data sets.	Signal Process.	2013	DBLP DOI BibTeX RDF
15	Shonda Gosselin, Artur Szymanski, Adam Pawel Wojda	Cyclic partitions of complete nonuniform hypergraphs and complete multipartite hypergraphs.	Discret. Math. Theor. Comput. Sci.	2013	DBLP DOI BibTeX RDF
15	Salama Nagy Daoud	Complexity of Products of Some Complete and Complete Bipartite Graphs.	J. Appl. Math.	2013	DBLP DOI BibTeX RDF
15	Mike J. Grannell, Martin Knor	Dihedral Biembeddings and Triangulations by Complete and Complete Tripartite Graphs.	Graphs Comb.	2013	DBLP DOI BibTeX RDF
15	Amen Souissi	Modélisation centrée sur les processus métier pour la génération complète de portails collaboratifs. (Business process-centered modeling for the complete generation of collaborative portals).		2013	RDF