Barnette's conjecture through the lens of the Mod_k P complexity classes
From MaRDI portal
Publication:2695474
Cites work
- scientific article; zbMATH DE number 3857154 (Why is no real title available?)
- scientific article; zbMATH DE number 4108816 (Why is no real title available?)
- scientific article; zbMATH DE number 3799016 (Why is no real title available?)
- scientific article; zbMATH DE number 3292649 (Why is no real title available?)
- scientific article; zbMATH DE number 3321957 (Why is no real title available?)
- #P-COMPLETENESS VIA MANY-ONE REDUCTIONS
- A note on 3-connected cubic planar graphs
- Computing and Combinatorics
- Construction of Barnette graphs whose large subgraphs are non-Hamiltonian
- Counting classes: Thresholds, parity, mods, and fewness
- Counting linear extensions
- Edge reductions in cyclically \(k\)-connected cubic graphs
- Inductive definition of two restricted classes of triangulations
- NP is as easy as detecting unique solutions
- On Hamiltonian Circuits
- On the construction of parallel computers from various basis of Boolean functions
- PRIMES is in P
- Polytopes, graphs, and complexes
- Reducibility among combinatorial problems
- Relations among MOD-classes
- The Complexity of Enumeration and Reliability Problems
- The Planar Hamiltonian Circuit Problem is NP-Complete
- The complexity of computing the permanent
- The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes.
- The complexity of theorem-proving procedures
This page was built for publication: Barnette's conjecture through the lens of the \(Mod_k P\) complexity classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695474)
